Guillaume Lagarde

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 23

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

Comput. Complex.

ICML

Sorbonne Paris Cité, France (PHD)

Education History

Sorbonne Paris Cité, France

PHD

Publications

Corto Mascle, Nathanaël Fijalkow, Guillaume Lagarde
Learning temporal formulas from examples is hard. CoRR (2023)
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) (2022)
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)
Vincent Cohen-Addad, Rémi de Joannis de Verclos, Guillaume Lagarde
Improving Ultrametrics Embeddings Through Coresets. ICML (2021)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. 30 (2) (2021)
Nathanaël Fijalkow, Guillaume Lagarde
The Complexity of Learning Linear Temporal Formulas from Examples. CoRR (2021)
Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Potta
Scaling Neural Program Synthesis with Distribution-based Search. CoRR (2021)
Nathanaël Fijalkow, Guillaume Lagarde
The complexity of learning linear temporal formulas from examples. ICGI (2021)
Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde
On Efficient Low Distortion Ultrametric Embedding. CoRR (2020)
Johan Håstad, Guillaume Lagarde, Joseph Swernofsky
d-Galvin Families. Electron. J. Comb. 27 (1) (2020)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS (2020)
Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, Joseph Swernofsky
Trade-Offs Between Size and Degree in Polynomial Calculus. ITCS (2020)
Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde
On Efficient Low Distortion Ultrametric Embedding. ICML (2020)
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. Comput. Complex. 28 (3) (2019)
Guillaume Lagarde, Guillaume Malod, Sylvain Perifel
Non-commutative computations: lower bounds and polynomial identity testing. Chic. J. Theor. Comput. Sci. 2019 (2019)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Electron. Colloquium Comput. Complex. 25 (2018)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. 25 (2018)
Guillaume Lagarde, Sylvain Perifel
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. SODA (2018)
Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins
De Bruijn-Erdős-type theorems for graphs and posets. Discret. Math. 340 (5) (2017)
Guillaume Lagarde, Sylvain Perifel
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. CoRR (2017)
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. MFCS (2017)
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees. Electron. Colloquium Comput. Complex. 24 (2017)
Guillaume Lagarde, Guillaume Malod, Sylvain Perifel
Non-commutative computations: lower bounds and polynomial identity testing. Electron. Colloquium Comput. Complex. 23 (2016)

Guillaume Lagarde.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guillaume Lagarde