Guillaume Malod

32 papers A* 2A 3B 2C 1Journal 20Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Towards Optimal Depth-Reductions for Algebraic Formulas.
Comput. Complex.
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2025 — conf
Exact Characterizations of Non-commutative Algebraic Complexity Without Homogeneity.
SOFSEM (2)
Guillaume Malod
2023 A conf
Towards Optimal Depth-Reductions for Algebraic Formulas.
CCC
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2023 J jnl
Towards Optimal Depth-Reductions for Algebraic Formulas.
CoRR
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2023 J jnl
Towards Optimal Depth-Reductions for Algebraic Formulas.
Electron. Colloquium Comput. Complex.
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas
2021 J jnl
Quantum communication complexity of distribution testing.
Quantum Inf. Comput.
Aleksandrs Belovs, Arturo Castellanos, Francois Le Gall, Guillaume Malod, Alexander A. Sherstov
2020 J jnl
Quantum Communication Complexity of Distribution Testing.
CoRR
Aleksandrs Belovs, Arturo Castellanos, François Le Gall, Guillaume Malod, Alexander A. Sherstov
2019 J jnl
Non-commutative computations: lower bounds and polynomial identity testing.
Chic. J. Theor. Comput. Sci.
Guillaume Lagarde, Guillaume Malod, Sylvain Perifel
2019 — conf
Nonnegative Rank Measures and Monotone Algebraic Branching Programs.
FSTTCS
Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas
2019 J jnl
Nonnegative rank measures and monotone algebraic branching programs.
Electron. Colloquium Comput. Complex.
Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas
2016 J jnl
Homomorphism Polynomials Complete for VP.
Chic. J. Theor. Comput. Sci.
Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh
2016 J jnl
Lower Bounds for Non-Commutative Skew Circuits.
Theory Comput.
Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2016 J jnl
Non-commutative computations: lower bounds and polynomial identity testing.
Electron. Colloquium Comput. Complex.
Guillaume Lagarde, Guillaume Malod, Sylvain Perifel
2015 J jnl
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication.
SIAM J. Comput.
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2015 J jnl
Lower bounds for non-commutative skew circuits.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2015 J jnl
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy.
Comput. Complex.
Hervé Fournier, Guillaume Malod, Stefan Mengel
2014 — conf
Homomorphism Polynomials Complete for VP.
FSTTCS
Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh
2014 J jnl
Homomorphism polynomials complete for VP.
Electron. Colloquium Comput. Complex.
Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh
2014 A* conf
Lower bounds for depth 4 formulas computing iterated matrix multiplication.
STOC
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2013 J jnl
Lower bounds for depth 4 formulas computing iterated matrix multiplication.
Electron. Colloquium Comput. Complex.
Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan
2012 A conf
Monomials in arithmetic circuits: Complete problems in the counting hierarchy.
STACS
Hervé Fournier, Guillaume Malod, Stefan Mengel
2012 A* conf
Separating multilinear branching programs and formulas.
STOC
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff
2011 J jnl
Monomials in arithmetic circuits: Complete problems in the counting hierarchy
CoRR
Hervé Fournier, Guillaume Malod, Stefan Mengel
2011 J jnl
Separating multilinear branching programs and formulas.
Electron. Colloquium Comput. Complex.
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff
2011 B conf
Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes.
FCT
Guillaume Malod
2008 J jnl
Characterizing Valiant's algebraic complexity classes.
J. Complex.
Guillaume Malod, Natacha Portier
2008 J jnl
Universal relations and #P-completeness.
Theor. Comput. Sci.
Hervé Fournier, Guillaume Malod
2007 A conf
The Complexity of Polynomials and Their Coefficient Functions.
CCC
Guillaume Malod
2006 B conf
Characterizing Valiant's Algebraic Complexity Classes.
MFCS
Guillaume Malod, Natacha Portier
2006 C conf
Universal Relations and #P-Completeness.
CIAC
Hervé Fournier, Guillaume Malod
2003 — —
Polynômes et coefficients. (Polynomials and coefficients).
Guillaume Malod
2002 J jnl
Naming Worlds in Modal and Temporal Logic.
J. Log. Lang. Inf.
Dov M. Gabbay, Guillaume Malod