Threshold Circuits for Iterated Multiplication: Using AC0 for Free. - Alexis Maciel; Denis Thérien (STACS, 1993)

Towards lower bounds for bounded-depth Frege proofs with modular connectives. - Alexis Maciel; Toniann Pitassi (Proof Complexity and Feasible Arithmetics, 1996)

On ACC0[pk] Frege Proofs. - Alexis Maciel; Toniann Pitassi (STOC, 1997)

Upper and Lower Bounds for Some Depth-3 Circuit Classes. - Richard Beigel; Alexis Maciel (Comput. Complex., 1997)

Threshold Circuits of Small Majority-Depth. - Alexis Maciel; Denis Thérien (Inf. Comput., 1998)

Circuit Lower Bounds Collapse Relativized Complexity Classes. - Richard Beigel; Alexis Maciel (CCC, 1999)

Efficient Threshold Circuits for Power Series. - Alexis Maciel; Denis Thérien (Inf. Comput., 1999)

Programs over semigroups of dot-depth one. - Alexis Maciel; Pierre Péladeau; Denis Thérien (Theor. Comput. Sci., 2000)

A New Proof of the Weak Pigeonhole Principle. - Alexis Maciel; Toniann Pitassi; Alan R. Woods (J. Comput. Syst. Sci., 2002)

Non-Automatizability of Bounded-Depth Frege Proofs. - Maria Luisa Bonet; Carlos Domingo; Ricard Gavaldà; Alexis Maciel; Toniann Pitassi (Comput. Complex., 2004)

Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. - Alexis Maciel; Toniann Pitassi (LICS, 2006)

Lifting lower bounds for tree-like proofs. - Alexis Maciel; Phuong Nguyen 001; Toniann Pitassi (Comput. Complex., 2014)