2006 |
14 | EE | Alexis Maciel,
Toniann Pitassi:
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives.
LICS 2006: 189-200 |
2004 |
13 | EE | Maria Luisa Bonet,
Carlos Domingo,
Ricard Gavaldà,
Alexis Maciel,
Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs.
Computational Complexity 13(1-2): 47-68 (2004) |
2002 |
12 | EE | Alexis Maciel,
Toniann Pitassi,
Alan R. Woods:
A New Proof of the Weak Pigeonhole Principle.
J. Comput. Syst. Sci. 64(4): 843-872 (2002) |
2000 |
11 | EE | Alexis Maciel,
Toniann Pitassi,
Alan R. Woods:
A new proof of the weak pigeonhole principle.
STOC 2000: 368-377 |
10 | EE | Alexis Maciel,
Pierre Péladeau,
Denis Thérien:
Programs over semigroups of dot-depth one.
Theor. Comput. Sci. 245(1): 135-148 (2000) |
1999 |
9 | EE | Maria Luisa Bonet,
Carlos Domingo,
Ricard Gavaldà,
Alexis Maciel,
Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs.
IEEE Conference on Computational Complexity 1999: 15-23 |
8 | EE | Richard Beigel,
Alexis Maciel:
Circuit Lower Bounds Collapse Relativized Complexity Classes.
IEEE Conference on Computational Complexity 1999: 222-226 |
7 | | Alexis Maciel,
Denis Thérien:
Efficient Threshold Circuits for Power Series.
Inf. Comput. 152(1): 62-73 (1999) |
1998 |
6 | | Alexis Maciel,
Denis Thérien:
Threshold Circuits of Small Majority-Depth.
Inf. Comput. 146(1): 55-83 (1998) |
1997 |
5 | EE | Richard Beigel,
Alexis Maciel:
Upper and Lower Bounds for Some Depth-3 Circuit Classes.
IEEE Conference on Computational Complexity 1997: 149-157 |
4 | EE | Alexis Maciel,
Toniann Pitassi:
On ACC0[pk] Frege Proofs.
STOC 1997: 720-729 |
3 | | Richard Beigel,
Alexis Maciel:
Upper and Lower Bounds for Some Depth-3 Circuit Classes.
Computational Complexity 6(3): 235-255 (1997) |
2 | EE | Richard Beigel,
Alexis Maciel:
Upper and Lower Bounds for Some Depth-3 Circuit Classes
Electronic Colloquium on Computational Complexity (ECCC) 4(2): (1997) |
1993 |
1 | | Alexis Maciel,
Denis Thérien:
Threshold Circuits for Iterated Multiplication: Using AC0 for Free.
STACS 1993: 545-565 |