Guillaume Lagarde

Cited by

	All	Since 2020
Citations	142	116
h-index	7	7
i10-index	5	4

2017201820192020202120222023202420251 16 1 1 19 17 31 35 13

Public access

View all

4 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Nathanaël FijalkowCNRS, LaBRI, BordeauxVerified email at labri.fr
Pierre OhlmannPostdoctoral researcher, University of WarsawVerified email at mimuw.edu.pl
Théo MATRICONPostdoc, DiverSE, IRISA/INRIA RennesVerified email at inria.fr
Vincent Cohen-AddadGoogle Research (former CNRS & Sorbonne Université)Verified email at lip6.fr
Kevin EllisCornellVerified email at cornell.edu
Akarsh PottaUndergrad in Computer Science and Engineering Department at Indian Institute of Technology, BombayVerified email at iitb.ac.in
Srikanth SrinivasanDepartment of Computer Science, University of CopenhagenVerified email at di.ku.dk
Nutan LimayeAssociate Professor, Computer Science, IT University of Copenhagen, DenmarkVerified email at itu.dk
Dmitry SokolovÉcole Polytechnique Fédérale de LausanneVerified email at epfl.ch
Corto MascleLaBRIVerified email at labri.fr
Casey TompkinsAlfréd Rényi Institute of Mathematics, BudapestVerified email at renyi.hu
Olivier SerreIRIF (Université Paris Cité & CNRS)Verified email at cnrs.fr
Abhishek MethukuUniversity of Illinois Urbana-ChampaignVerified email at illinois.edu
Jakob NordströmUniversity of Copenhagen and Lund UniversityVerified email at di.ku.dk
David MalecPostdoc, Department of Economics, University of MarylandVerified email at umd.edu
Johan HåstadProfessor i teoretisk datalogi, KTHVerified email at kth.se

Guillaume Lagarde

LaBRI

Verified email at labri.fr - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The complexity of learning linear temporal formulas from examples N Fijalkow, G Lagarde International Conference on Grammatical Inference, 237-250, 2021	32	2021
Non-commutative computations: lower bounds and polynomial identity testing G Lagarde, G Malod, S Perifel Chicago Journal of Theoretical Computer Science 2 (1-19), 10, 2019	20	2019
Scaling neural program synthesis with distribution-based search N Fijalkow, G Lagarde, T Matricon, K Ellis, P Ohlmann, AN Potta Proceedings of the AAAI Conference on Artificial Intelligence 36 (6), 6623-6630, 2022	17	2022
Lempel-Ziv: a “one-bit catastrophe” but not a tragedy G Lagarde, S Perifel Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	17	2018
Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees G Lagarde, N Limaye, S Srinivasan computational complexity 28, 471-542, 2019	13	2019
Improving ultrametrics embeddings through coresets V Cohen-Addad, RDJ De Verclos, G Lagarde International Conference on Machine Learning, 2060-2068, 2021	9	2021
On efficient low distortion ultrametric embedding V Cohen-Addad, CS Karthik, G Lagarde International Conference on Machine Learning, 2078-2088, 2020	9	2020
Learning temporal formulas from examples is hard C Mascle, N Fijalkow, G Lagarde arXiv preprint arXiv:2312.16336, 2023	4	2023
Lower bounds for arithmetic circuits via the hankel matrix N Fijalkow, G Lagarde, P Ohlmann, O Serre computational complexity 30, 1-60, 2021	4	2021
Trade-offs between size and degree in polynomial calculus G Lagarde, J Nordström, D Sokolov, J Swernofsky 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 72 …, 2020	4	2020
Tight bounds using hankel matrix for arithmetic circuits with unique parse trees N Fijalkow, G Lagarde, P Ohlmann Electronic Colloquium on Computational Complexity (ECCC) 25, 38, 2018	4	2018
De Bruijn–Erdős-type theorems for graphs and posets P Aboulker, G Lagarde, D Malec, A Methuku, C Tompkins Discrete Mathematics 340 (5), 995-999, 2017	4	2017
Deepsynth: Scaling neural program synthesis with distribution-based search T Matricon, N Fijalkow, G Lagarde, K Ellis Journal of Open Source Software 7 (78), 4151, 2022	2	2022
Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (extended version) G Lagarde, N Limaye, S Srinivasan Computational Complexity, 0	2
-Galvin families J Håstad, G Lagarde, J Swernofsky arXiv preprint arXiv:1901.02652, 2019	1	2019
A -Approximation for Ultrametric Embedding in Subquadratic Time G Bathie, G Lagarde arXiv preprint arXiv:2503.13409, 2025		2025
EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis T Matricon, N Fijalkow, G Lagarde arXiv preprint arXiv:2412.17330, 2024		2024
Improving Ultrametrics Embeddings Through Coresets G Lagarde, RDJ de Verclos, VP Cohen-addad		2021
Contributions to arithmetic complexity and compression G Lagarde Université Sorbonne Paris Cité, 2018		2018

The system can't perform the operation now. Try again later.

Articles 1–19

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors