De Bruijn-Erdős-type theorems for graphs and posets. - Pierre Aboulker; Guillaume Lagarde; David Malec; Abhishek Methuku; Casey Tompkins (Discret. Math., 2017)

Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. - Guillaume Lagarde; Sylvain Perifel (SODA, 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)

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

Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. - Guillaume Lagarde; Nutan Limaye; Srikanth Srinivasan 001 (Comput. Complex., 2019)

Non-commutative computations: lower bounds and polynomial identity testing. - Guillaume Lagarde; Guillaume Malod; Sylvain Perifel (Chic. J. Theor. Comput. Sci., 2019)

On Efficient Low Distortion Ultrametric Embedding. - Vincent Cohen-Addad; Karthik C. S. 001; Guillaume Lagarde (ICML, 2020)

Trade-Offs Between Size and Degree in Polynomial Calculus. - Guillaume Lagarde; Jakob Nordström; Dmitry Sokolov 001; Joseph Swernofsky (ITCS, 2020)

d-Galvin Families. - Johan Håstad; Guillaume Lagarde; Joseph Swernofsky (Electron. J. Comb., 2020)

The complexity of learning linear temporal formulas from examples. - Nathanaël Fijalkow; Guillaume Lagarde (ICGI, 2021)

Improving Ultrametrics Embeddings Through Coresets. - Vincent Cohen-Addad; Rémi de Joannis de Verclos; Guillaume Lagarde (ICML, 2021)

Lower Bounds for Arithmetic Circuits via the Hankel Matrix. - Nathanaël Fijalkow; Guillaume Lagarde; Pierre Ohlmann; Olivier Serre (Comput. Complex., 2021)

Scaling Neural Program Synthesis with Distribution-Based Search. - Nathanaël Fijalkow; Guillaume Lagarde; Théo Matricon; Kevin Ellis; Pierre Ohlmann; Akarsh Nayan Potta (AAAI, 2022)

DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search. - Théo Matricon; Nathanaël Fijalkow; Guillaume Lagarde; Kevin Ellis (J. Open Source Softw., 2022)

Learning temporal formulas from examples is hard. - Corto Mascle; Nathanaël Fijalkow; Guillaume Lagarde (CoRR, 2023)

EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis. - Théo Matricon; Nathanaël Fijalkow; Guillaume Lagarde (CoRR, 2024)

A (1+?)-Approximation for Ultrametric Embedding in Subquadratic Time. - Gabriel Bathie; Guillaume Lagarde (AAAI, 2025)

Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis. - Théo Matricon; Nathanaël Fijalkow; Guillaume Lagarde (AAAI, 2025)

A (1+ε)-Approximation for Ultrametric Embedding in Subquadratic Time. - Gabriel Bathie; Guillaume Lagarde (CoRR, 2025)