Researcher profile · Semantic Scholar

Guillaume Lagarde

h-index: 8
Works: 18
Citations: 140

Most-cited papers

The Complexity of Learning Linear Temporal Formulas from Examples
Nathanaël Fijalkow, Guillaume Lagarde
2021International Conference on Graphics and Interaction27 citations
Semantic Scholar
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees
Guillaume Lagarde, N. Limaye, Srikanth Srinivasan
2018Computational Complexity18 citations Open access
Semantic Scholar
Non-commutative computations: lower bounds and polynomial identity testing
Guillaume Lagarde, Guillaume Malod, Sylvain Perifel
2016Electron. Colloquium Comput. Complex.17 citations
Semantic Scholar
On Efficient Low Distortion Ultrametric Embedding
Vincent Cohen-Addad, S. KarthikC, Guillaume Lagarde
2020International Conference on Machine Learning14 citations
Semantic Scholar
Scaling Neural Program Synthesis with Distribution-based Search
Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis +2 more
2021AAAI Conference on Artificial Intelligence12 citations Open access
Semantic Scholar
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy
Guillaume Lagarde, Sylvain Perifel
2017ACM-SIAM Symposium on Discrete Algorithms11 citations Open access
Semantic Scholar
Improving Ultrametrics Embeddings Through Coresets
Vincent Cohen-Addad, Rémi de Joannis de Verclos, Guillaume Lagarde
2021International Conference on Machine Learning10 citations
Semantic Scholar
Learning temporal formulas from examples is hard
Corto Mascle, Nathanaël Fijalkow, Guillaume Lagarde
2023arXiv.org9 citations
Semantic Scholar
DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search
Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde, Kevin Ellis
2022Journal of Open Source Software5 citations Open access
Semantic Scholar
De Bruijn-Erdős-type theorems for graphs and posets
Pierre Aboulker, Guillaume Lagarde, David L. Malec, Abhishek Methuku +1 more
2015Discrete Mathematics5 citations Open access
Semantic Scholar
Lower Bounds for Arithmetic Circuits via the Hankel Matrix
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, O. Serre
2020Computational Complexity4 citations Open access
Semantic Scholar
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann
2018Electron. Colloquium Comput. Complex.3 citations
Semantic Scholar
Trade-Offs Between Size and Degree in Polynomial Calculus
Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, Joseph Swernofsky
2020Information Technology Convergence and Services2 citations
Semantic Scholar
Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis
Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde
2025AAAI Conference on Artificial Intelligence1 citations Open access
Semantic Scholar
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees
Guillaume Lagarde, N. Limaye, Srikanth Srinivasan
2018Computational Complexity1 citations Open access
Semantic Scholar
EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis
Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde
2024arXiv.org0 citations
Semantic Scholar
LOWER BOUNDS FOR ARITHMETIC
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, O. Serre
20210 citations
Semantic Scholar
Contributions to arithmetic complexity and compression. (Contributions à la complexité arithmétique et à la compression)
Guillaume Lagarde
20180 citations Open access
Semantic Scholar

Srikanth Srinivasan

×2

Sylvain Perifel×2

Vincent Cohen-Addad×2

O. Serre×2

Guillaume Malod×1

S. KarthikC×1

Kevin Ellis×1

Akarsh Potta×1