Alexis Maciel

According to our database, Alexis Maciel authored at least 12 papers between 1993 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Lifting lower bounds for tree-like proofs.

Alexis Maciel, Phuong Nguyen, Toniann Pitassi

Comput. Complex., 2014

2006

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

Alexis Maciel, Toniann Pitassi

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2004

Non-Automatizability of Bounded-Depth Frege Proofs.

Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi

Comput. Complex., 2004

2002

A New Proof of the Weak Pigeonhole Principle.

Alexis Maciel, Toniann Pitassi, Alan R. Woods

J. Comput. Syst. Sci., 2002

2000

Programs over semigroups of dot-depth one.

Alexis Maciel, Pierre Péladeau, Denis Thérien

Theor. Comput. Sci., 2000

1999

Efficient Threshold Circuits for Power Series.

Alexis Maciel, Denis Thérien

Inf. Comput., 1999

Circuit Lower Bounds Collapse Relativized Complexity Classes.

Richard Beigel, Alexis Maciel

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

Threshold Circuits of Small Majority-Depth.

Alexis Maciel, Denis Thérien

Inf. Comput., 1998

1997

Upper and Lower Bounds for Some Depth-3 Circuit Classes.

Richard Beigel, Alexis Maciel

Comput. Complex., 1997

On ACC⁰[<i>p^k</i>] Frege Proofs.

Alexis Maciel, Toniann Pitassi

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

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

Alexis Maciel, Toniann Pitassi

Proceedings of the Proof Complexity and Feasible Arithmetics, 1996

1993

Threshold Circuits for Iterated Multiplication: Using AC0 for Free.

Alexis Maciel, Denis Thérien

Proceedings of the STACS 93, 1993