Guillaume Malod

According to our database, Guillaume Malod authored at least 15 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Towards Optimal Depth-Reductions for Algebraic Formulas.

Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas

Electron. Colloquium Comput. Complex., 2023

2021

Quantum communication complexity of distribution testing.

Aleksandrs Belovs, Arturo Castellanos, Francois Le Gall, Guillaume Malod, Alexander A. Sherstov

Quantum Inf. Comput., 2021

2019

Nonnegative rank measures and monotone algebraic branching programs.

Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas

Electron. Colloquium Comput. Complex., 2019

Non-commutative computations: lower bounds and polynomial identity testing.

Guillaume Lagarde, Guillaume Malod, Sylvain Perifel

Chic. J. Theor. Comput. Sci., 2019

2016

Homomorphism Polynomials Complete for VP.

Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh

Chic. J. Theor. Comput. Sci., 2016

2015

Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication.

Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan

SIAM J. Comput., 2015

Lower bounds for non-commutative skew circuits.

Nutan Limaye, Guillaume Malod, Srikanth Srinivasan

Electron. Colloquium Comput. Complex., 2015

Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy.

Hervé Fournier, Guillaume Malod, Stefan Mengel

Comput. Complex., 2015

2011

Separating multilinear branching programs and formulas.

Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff

Electron. Colloquium Comput. Complex., 2011

Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes.

Guillaume Malod

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2008

Universal relations and #P-completeness.

Hervé Fournier, Guillaume Malod

Theor. Comput. Sci., 2008

Characterizing Valiant's algebraic complexity classes.

Guillaume Malod, Natacha Portier

J. Complex., 2008

2007

The Complexity of Polynomials and Their Coefficient Functions.

Guillaume Malod

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

2003

Polynômes et coefficients. (Polynomials and coefficients).

Guillaume Malod

PhD thesis, 2003

2002

Naming Worlds in Modal and Temporal Logic.

Dov M. Gabbay, Guillaume Malod

J. Log. Lang. Inf., 2002