( en | de | ru )

 

Disambiguation of "Lagarde, Guillaume"

Author of the publication

copydeleteadd this publication to your clipboard
DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search.

, , , and . J. Open Source Softw., 7 (78): 4151 (October 2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthieu Lagarde

Marianne Durand-Lagarde

Guillaume Klein

Guillaume Pierre

Guillaume Wendt

 

Other publications of authors with the same name

Lower Bounds for Arithmetic Circuits via the Hankel Matrix., , , and . STACS, volume 154 of LIPIcs, page 24:1-24:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Lempel-Ziv: a öne-bit catastrophe" but not a tragedy., and . SODA, page 1478-1495. SIAM, (2018)DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search., , , and . J. Open Source Softw., 7 (78): 4151 (October 2022)d-Galvin Families., , and . Electron. J. Comb., 27 (1): 1 (2020)Scaling Neural Program Synthesis with Distribution-Based Search., , , , , and . AAAI, page 6623-6630. AAAI Press, (2022)Non-commutative computations: lower bounds and polynomial identity testing., , and . Chic. J. Theor. Comput. Sci., (2019)Lower Bounds for Arithmetic Circuits via the Hankel Matrix., , , and . Comput. Complex., 30 (2): 14 (2021)Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees., , and . Electron. Colloquium Comput. Complex., (2018)On Efficient Low Distortion Ultrametric Embedding., , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 2078-2088. PMLR, (2020)Improving Ultrametrics Embeddings Through Coresets., , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 2060-2068. PMLR, (2021)