Guillaume Malod

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 14

Top Venues

Electron. Colloquium Comput. Complex.

Chic. J. Theor. Comput. Sci.

CoRR

FSTTCS

Claude Bernard University Lyon 1, France (PHD)

Education History

Claude Bernard University Lyon 1, France

PHD

Publications

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

Guillaume Malod.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guillaume Malod