Naming Worlds in Modal and Temporal Logic. - Dov M. Gabbay; Guillaume Malod (J. Log. Lang. Inf., 2002)

Polynômes et coefficients. (Polynomials and coefficients). - Guillaume Malod (2003)

The Complexity of Polynomials and Their Coefficient Functions. - Guillaume Malod (CCC, 2007)

Characterizing Valiant's algebraic complexity classes. - Guillaume Malod; Natacha Portier (J. Complex., 2008)

Universal relations and #P-completeness. - Hervé Fournier; Guillaume Malod (Theor. Comput. Sci., 2008)

Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes. - Guillaume Malod (FCT, 2011)

Separating multilinear branching programs and formulas. - Zeev Dvir; Guillaume Malod; Sylvain Perifel; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2011)

Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. - Hervé Fournier; Guillaume Malod; Stefan Mengel (Comput. Complex., 2015)

Lower bounds for non-commutative skew circuits. - Nutan Limaye; Guillaume Malod; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2015)

Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. - Hervé Fournier; Nutan Limaye; Guillaume Malod; Srikanth Srinivasan 001 (SIAM J. Comput., 2015)

Homomorphism Polynomials Complete for VP. - Arnaud Durand 001; Meena Mahajan; Guillaume Malod; Nicolas de Rugy-Altherre; Nitin Saurabh (Chic. J. Theor. Comput. Sci., 2016)

Non-commutative computations: lower bounds and polynomial identity testing. - Guillaume Lagarde; Guillaume Malod; Sylvain Perifel (Chic. J. Theor. Comput. Sci., 2019)

Nonnegative rank measures and monotone algebraic branching programs. - Hervé Fournier; Guillaume Malod; Maud Szusterman; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2019)

Quantum communication complexity of distribution testing. - Aleksandrs Belovs; Arturo Castellanos 002; Francois Le Gall; Guillaume Malod; Alexander A. Sherstov (Quantum Inf. Comput., 2021)

Towards Optimal Depth-Reductions for Algebraic Formulas. - Hervé Fournier; Nutan Limaye; Guillaume Malod; Srikanth Srinivasan 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2023)

Exact Characterizations of Non-commutative Algebraic Complexity Without Homogeneity. - Guillaume Malod (SOFSEM (2), 2025)