| 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 | 19 | 2019 |
| 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 | 14 | 2019 |
| The complexity of learning linear temporal formulas from examples N Fijalkow, G Lagarde International Conference on Grammatical Inference, 237-250, 2021 | 10 | 2021 |
| 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 | 9 | 2018 |
| Improving ultrametrics embeddings through coresets V Cohen-Addad, RDJ De Verclos, G Lagarde International Conference on Machine Learning, 2060-2068, 2021 | 8 | 2021 |
| On efficient low distortion ultrametric embedding V Cohen-Addad, CS Karthik, G Lagarde International Conference on Machine Learning, 2078-2088, 2020 | 8 | 2020 |
| 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 | 6 | 2022 |
| 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 | 5 | 2020 |
| 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 |
| 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 | 3 | 2018 |
| Lower bounds for arithmetic circuits via the hankel matrix N Fijalkow, G Lagarde, P Ohlmann, O Serre computational complexity 30, 1-60, 2021 | 2 | 2021 |
| 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 | 1 | 2022 |
| -Galvin families J Håstad, G Lagarde, J Swernofsky arXiv preprint arXiv:1901.02652, 2019 | 1 | 2019 |
| 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 |
