Guillaume Malod

According to our database, Guillaume Malod authored at least 16 papers between 2002 and 2025.

Collaborative distances:

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

2025

Exact Characterizations of Non-commutative Algebraic Complexity Without Homogeneity.

Guillaume Malod

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

2023

Towards Optimal Depth-Reductions for Algebraic Formulas.

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

Proceedings of the 38th Computational Complexity Conference, 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

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2016

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

Guillaume Lagarde, Guillaume Malod, Sylvain Perifel

Electron. Colloquium Comput. Complex., 2016

2015

Lower bounds for non-commutative skew circuits.

Nutan Limaye, Guillaume Malod, Srikanth Srinivasan

Electron. Colloquium Comput. Complex., 2015

2014

Lower bounds for depth 4 formulas computing iterated matrix multiplication.

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

Proceedings of the Symposium on Theory of Computing, 2014

Homomorphism Polynomials Complete for VP.

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

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2012

Separating multilinear branching programs and formulas.

Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Monomials in arithmetic circuits: Complete problems in the counting hierarchy.

Hervé Fournier, Guillaume Malod, Stefan Mengel

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011

Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes.

Guillaume Malod

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

2007

The Complexity of Polynomials and Their Coefficient Functions.

Guillaume Malod

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

2006

Characterizing Valiant's Algebraic Complexity Classes.

Guillaume Malod, Natacha Portier

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Universal Relations and #P-Completeness.

Hervé Fournier, Guillaume Malod

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

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