Follow
Guillaume Lagarde
Guillaume Lagarde
LaBRI, CNRS
Verified email at labri.fr - Homepage
Title
Cited by
Cited by
Year
Non-commutative computations: lower bounds and polynomial identity testing
G Lagarde, G Malod, S Perifel
Chic. J. Theor. Comput. Sci 2, 1-19, 2019
182019
Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees
G Lagarde, N Limaye, S Srinivasan
computational complexity 28 (3), 471-542, 2019
122019
The complexity of learning linear temporal formulas from examples
N Fijalkow, G Lagarde
International Conference on Grammatical Inference, 237-250, 2021
62021
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), 2020
62020
On efficient low distortion ultrametric embedding
V Cohen-Addad, CS Karthik, G Lagarde
International Conference on Machine Learning, 2078-2088, 2020
52020
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
52018
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
52017
Improving ultrametrics embeddings through coresets
V Cohen-Addad, RDJ De Verclos, G Lagarde
International Conference on Machine Learning, 2060-2068, 2021
42021
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees.
N Fijalkow, G Lagarde, P Ohlmann
Electron. Colloquium Comput. Complex. 25, 38, 2018
32018
Lower bounds for arithmetic circuits via the Hankel matrix
N Fijalkow, G Lagarde, P Ohlmann, O Serre
computational complexity 30 (2), 1-60, 2021
22021
-Galvin families
J Håstad, G Lagarde, J Swernofsky
arXiv preprint arXiv:1901.02652, 2019
12019
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
2022
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–14