Guillaume Lagarde

According to our database, Guillaume Lagarde authored at least 19 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A (1+ε)-Approximation for Ultrametric Embedding in Subquadratic Time.

Gabriel Bathie, Guillaume Lagarde

CoRR, March, 2025

Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis.

Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

A (1+?)-Approximation for Ultrametric Embedding in Subquadratic Time.

Gabriel Bathie, Guillaume Lagarde

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis.

Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde

CoRR, 2024

2023

Learning temporal formulas from examples is hard.

Corto Mascle, Nathanaël Fijalkow, Guillaume Lagarde

CoRR, 2023

2022

DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search.

Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde, Kevin Ellis

J. Open Source Softw., October, 2022

Scaling Neural Program Synthesis with Distribution-Based Search.

Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Lower Bounds for Arithmetic Circuits via the Hankel Matrix.

Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre

Comput. Complex., 2021

Improving Ultrametrics Embeddings Through Coresets.

Vincent Cohen-Addad, Rémi de Joannis de Verclos, Guillaume Lagarde

Proceedings of the 38th International Conference on Machine Learning, 2021

The complexity of learning linear temporal formulas from examples.

Nathanaël Fijalkow, Guillaume Lagarde

Proceedings of the 15th International Conference on Grammatical Inference, 2021

2020

d-Galvin Families.

Johan Håstad, Guillaume Lagarde, Joseph Swernofsky

Electron. J. Comb., 2020

Trade-Offs Between Size and Degree in Polynomial Calculus.

Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, Joseph Swernofsky

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

On Efficient Low Distortion Ultrametric Embedding.

Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Non-commutative computations: lower bounds and polynomial identity testing.

Guillaume Lagarde, Guillaume Malod, Sylvain Perifel

Chic. J. Theor. Comput. Sci., 2019

Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees.

Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan

Comput. Complex., 2019

2018

Contributions to arithmetic complexity and compression. (Contributions à la complexité arithmétique et à la compression).

Guillaume Lagarde

PhD thesis, 2018

Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees.

Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann

Electron. Colloquium Comput. Complex., 2018

Lempel-Ziv: a "one-bit catastrophe" but not a tragedy.

Guillaume Lagarde, Sylvain Perifel

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

De Bruijn-Erdős-type theorems for graphs and posets.

Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins

Discret. Math., 2017