| 2025 | AAAI | A (1+?)-Approximation for Ultrametric Embedding in Subquadratic Time. | Gabriel Bathie, Guillaume Lagarde |
| 2025 | AAAI | Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis. | Tho Matricon, Nathanal Fijalkow, Guillaume Lagarde |
| 2022 | AAAI | Scaling Neural Program Synthesis with Distribution-Based Search. | Nathanal Fijalkow, Guillaume Lagarde, Tho Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta |
| 2021 | ICML | Improving Ultrametrics Embeddings Through Coresets. | Vincent Cohen-Addad, Rmi de Joannis de Verclos, Guillaume Lagarde |
| 2020 | ICML | On Efficient Low Distortion Ultrametric Embedding. | Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde |
| 2020 | STACS | Lower Bounds for Arithmetic Circuits via the Hankel Matrix. | Nathanal Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre |
| 2018 | SODA | Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. | Guillaume Lagarde, Sylvain Perifel |
| 2017 | MFCS | Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. | Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan |