Guillaume Lagarde

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
scientific article; zbMATH DE number 7650909 (Why is no real title available?)	2023-02-07	Paper
Lower bounds for arithmetic circuits via the Hankel matrix Computational Complexity	2021-11-24	Paper
On Efficient Low Distortion Ultrametric Embedding	2020-08-15	Paper
scientific article; zbMATH DE number 7204375 (Why is no real title available?)	2020-05-26	Paper
\(d\)-Galvin families The Electronic Journal of Combinatorics	2020-02-10	Paper
\(d\)-Galvin families The Electronic Journal of Combinatorics	2020-02-10	Paper
Non-commutative computations: lower bounds and polynomial identity testing Chicago Journal of Theoretical Computer Science	2019-09-12	Paper
Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees Computational Complexity	2019-08-30	Paper
Lempel-Ziv: a ``one-bit catastrophe'' but not a tragedy	2018-03-15	Paper
Lempel-Ziv: a ``one-bit catastrophe'' but not a tragedy (available as arXiv preprint)	2018-03-15	Paper
De Bruijn-Erdős-type theorems for graphs and posets Discrete Mathematics	2017-02-27	Paper

Research outcomes over time

This page was built for person: Guillaume Lagarde