![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Guillaume Lagarde
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i9]Corto Mascle, Nathanaël Fijalkow, Guillaume Lagarde:
Learning temporal formulas from examples is hard. CoRR abs/2312.16336 (2023) - 2022
- [j6]Théo Matricon
, Nathanaël Fijalkow
, Guillaume Lagarde, Kevin Ellis:
DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search. J. Open Source Softw. 7(78): 4151 (2022) - [c8]Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon
, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta:
Scaling Neural Program Synthesis with Distribution-Based Search. AAAI 2022: 6623-6630 - 2021
- [j5]Nathanaël Fijalkow
, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. 30(2): 14 (2021) - [c7]Nathanaël Fijalkow
, Guillaume Lagarde:
The complexity of learning linear temporal formulas from examples. ICGI 2021: 237-250 - [c6]Vincent Cohen-Addad, Rémi de Joannis de Verclos, Guillaume Lagarde:
Improving Ultrametrics Embeddings Through Coresets. ICML 2021: 2060-2068 - [i8]Nathanaël Fijalkow, Guillaume Lagarde:
The Complexity of Learning Linear Temporal Formulas from Examples. CoRR abs/2102.00876 (2021) - [i7]Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Potta:
Scaling Neural Program Synthesis with Distribution-based Search. CoRR abs/2110.12485 (2021) - 2020
- [j4]Johan Håstad, Guillaume Lagarde, Joseph Swernofsky:
d-Galvin Families. Electron. J. Comb. 27(1): 1 (2020) - [c5]Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde:
On Efficient Low Distortion Ultrametric Embedding. ICML 2020: 2078-2088 - [c4]Guillaume Lagarde, Jakob Nordström
, Dmitry Sokolov
, Joseph Swernofsky:
Trade-Offs Between Size and Degree in Polynomial Calculus. ITCS 2020: 72:1-72:16 - [c3]Nathanaël Fijalkow
, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS 2020: 24:1-24:17 - [i6]Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde:
On Efficient Low Distortion Ultrametric Embedding. CoRR abs/2008.06700 (2020)
2010 – 2019
- 2019
- [j3]Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
:
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. Comput. Complex. 28(3): 471-542 (2019) - [j2]Guillaume Lagarde, Guillaume Malod, Sylvain Perifel:
Non-commutative computations: lower bounds and polynomial identity testing. Chic. J. Theor. Comput. Sci. 2019 (2019) - 2018
- [b1]Guillaume Lagarde:
Contributions to arithmetic complexity and compression. (Contributions à la complexité arithmétique et à la compression). Sorbonne Paris Cité, France, 2018 - [c2]Guillaume Lagarde, Sylvain Perifel:
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. SODA 2018: 1478-1495 - [i5]Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann:
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Electron. Colloquium Comput. Complex. TR18 (2018) - [i4]Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j1]Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins:
De Bruijn-Erdős-type theorems for graphs and posets. Discret. Math. 340(5): 995-999 (2017) - [c1]Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
:
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. MFCS 2017: 41:1-41:14 - [i3]Guillaume Lagarde, Sylvain Perifel:
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. CoRR abs/1707.04312 (2017) - [i2]Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan:
Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i1]Guillaume Lagarde, Guillaume Malod, Sylvain Perifel:
Non-commutative computations: lower bounds and polynomial identity testing. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint