Alexis Maciel

16 papers A* 3A 4Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2014 J jnl
Lifting lower bounds for tree-like proofs.
Comput. Complex.
Alexis Maciel, Phuong Nguyen, Toniann Pitassi
2006 A* conf
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives.
LICS
Alexis Maciel, Toniann Pitassi
2004 J jnl
Non-Automatizability of Bounded-Depth Frege Proofs.
Comput. Complex.
Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
2002 J jnl
A New Proof of the Weak Pigeonhole Principle.
J. Comput. Syst. Sci.
Alexis Maciel, Toniann Pitassi, Alan R. Woods
2000 A* conf
A new proof of the weak pigeonhole principle.
STOC
Alexis Maciel, Toniann Pitassi, Alan R. Woods
2000 J jnl
Programs over semigroups of dot-depth one.
Theor. Comput. Sci.
Alexis Maciel, Pierre Péladeau, Denis Thérien
1999 A conf
Circuit Lower Bounds Collapse Relativized Complexity Classes.
CCC
Richard Beigel, Alexis Maciel
1999 J jnl
Efficient Threshold Circuits for Power Series.
Inf. Comput.
Alexis Maciel, Denis Thérien
1999 A conf
Non-Automatizability of Bounded-Depth Frege Proofs.
CCC
Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi
1998 J jnl
Threshold Circuits of Small Majority-Depth.
Inf. Comput.
Alexis Maciel, Denis Thérien
1997 A* conf
On ACC
STOC
Alexis Maciel, Toniann Pitassi
1997 J jnl
Upper and Lower Bounds for Some Depth-3 Circuit Classes
Electron. Colloquium Comput. Complex.
Richard Beigel, Alexis Maciel
1997 A conf
Upper and Lower Bounds for Some Depth-3 Circuit Classes.
CCC
Richard Beigel, Alexis Maciel
1997 J jnl
Upper and Lower Bounds for Some Depth-3 Circuit Classes.
Comput. Complex.
Richard Beigel, Alexis Maciel
1996 — conf
Towards lower bounds for bounded-depth Frege proofs with modular connectives.
Proof Complexity and Feasible Arithmetics
Alexis Maciel, Toniann Pitassi
1993 A conf
Threshold Circuits for Iterated Multiplication: Using AC0 for Free.
STACS
Alexis Maciel, Denis Thérien