Guillaume Lagarde

30 papers A* 6A 2B 1Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Analyzing and Leveraging the
CoRR
Gabriel Bathie, Paul Huber, Guillaume Lagarde, Akka Zemmari
2025 A* conf
A (1+?)-Approximation for Ultrametric Embedding in Subquadratic Time.
AAAI
Gabriel Bathie, Guillaume Lagarde
2025 J jnl
A (1+ε)-Approximation for Ultrametric Embedding in Subquadratic Time.
CoRR
Gabriel Bathie, Guillaume Lagarde
2025 A* conf
Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis.
AAAI
Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde
2025 J jnl
ParamExplorer: A framework for exploring parameters in generative art.
CoRR
Julien Gachadoat, Guillaume Lagarde
2024 J jnl
EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis.
CoRR
Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde
2023 J jnl
Learning temporal formulas from examples is hard.
CoRR
Corto Mascle, Nathanaël Fijalkow, Guillaume Lagarde
2022 J jnl
DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search.
J. Open Source Softw.
Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde, Kevin Ellis
2022 A* conf
Scaling Neural Program Synthesis with Distribution-Based Search.
AAAI
Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta
2021 A* conf
Improving Ultrametrics Embeddings Through Coresets.
ICML
Vincent Cohen-Addad, Rémi de Joannis de Verclos, Guillaume Lagarde
2021 J jnl
Lower Bounds for Arithmetic Circuits via the Hankel Matrix.
Comput. Complex.
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
2021 J jnl
Scaling Neural Program Synthesis with Distribution-based Search.
CoRR
Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Potta
2021 J jnl
The Complexity of Learning Linear Temporal Formulas from Examples.
CoRR
Nathanaël Fijalkow, Guillaume Lagarde
2021 — conf
The complexity of learning linear temporal formulas from examples.
ICGI
Nathanaël Fijalkow, Guillaume Lagarde
2020 A conf
Lower Bounds for Arithmetic Circuits via the Hankel Matrix.
STACS
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
2020 A* conf
On Efficient Low Distortion Ultrametric Embedding.
ICML
Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde
2020 J jnl
On Efficient Low Distortion Ultrametric Embedding.
CoRR
Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde
2020 A conf
Trade-Offs Between Size and Degree in Polynomial Calculus.
ITCS
Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, Joseph Swernofsky
2020 J jnl
d-Galvin Families.
Electron. J. Comb.
Johan Håstad, Guillaume Lagarde, Joseph Swernofsky
2019 J jnl
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees.
Comput. Complex.
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
2019 J jnl
Non-commutative computations: lower bounds and polynomial identity testing.
Chic. J. Theor. Comput. Sci.
Guillaume Lagarde, Guillaume Malod, Sylvain Perifel
2018 — —
Contributions to arithmetic complexity and compression. (Contributions à la complexité arithmétique et à la compression).
Guillaume Lagarde
2018 A* conf
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy.
SODA
Guillaume Lagarde, Sylvain Perifel
2018 J jnl
Lower bounds for arithmetic circuits via the Hankel matrix.
Electron. Colloquium Comput. Complex.
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
2018 J jnl
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees.
Electron. Colloquium Comput. Complex.
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann
2017 J jnl
De Bruijn-Erdős-type theorems for graphs and posets.
Discret. Math.
Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins
2017 J jnl
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy.
CoRR
Guillaume Lagarde, Sylvain Perifel
2017 B conf
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees.
MFCS
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
2017 J jnl
Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees.
Electron. Colloquium Comput. Complex.
Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan
2016 J jnl
Non-commutative computations: lower bounds and polynomial identity testing.
Electron. Colloquium Comput. Complex.
Guillaume Lagarde, Guillaume Malod, Sylvain Perifel