Alexis Maciel

A new proof of the weak pigeonhole principle

Toniann Pitassi, Alan R. Woods, Alexis Maciel, 2000, Symposium on the Theory of Computing.

Towards lower bounds for bounded-depth Frege proofs with modular connectives

Toniann Pitassi, Alexis Maciel, T. Pitassi, 1996, Proof Complexity and Feasible Arithmetics.

Upper and lower bounds for some depth-3 circuit classes

Richard Beigel, Alexis Maciel, R. Beigel, 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

Non-Automatizability of Bounded-Depth Frege Proofs

Toniann Pitassi, Carlos Domingo, Maria Luisa Bonet, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives

Toniann Pitassi, Alexis Maciel, T. Pitassi, 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

Circuit lower bounds collapse relativized complexity classes

Richard Beigel, Alexis Maciel, R. Beigel, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).