| 2004 |
|---|
| 12 | EE | Alan R. Woods:
Subset sum "cubes" and the complexity of primality testing.
Theor. Comput. Sci. 322(1): 203-219 (2004) |
| 2002 |
|---|
| 11 | 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 |
|---|
| 10 | EE | Alexis Maciel,
Toniann Pitassi,
Alan R. Woods:
A new proof of the weak pigeonhole principle.
STOC 2000: 368-377 |
| 1998 |
|---|
| 9 | EE | Alan R. Woods:
Unsatisfiable Systems of Equations, Over a Finite Field.
FOCS 1998: 202-211 |
| 8 | | Petr Savický,
Alan R. Woods:
The number of Boolean functions computed by formulas of a given size.
Random Struct. Algorithms 13(3-4): 349-382 (1998) |
| 1997 |
|---|
| 7 | | Alan R. Woods:
Counting Finite Models.
J. Symb. Log. 62(3): 925-949 (1997) |
| 6 | | Alan R. Woods:
Coloring rules for finite trees, and probabilities of monadic second order sentences.
Random Struct. Algorithms 10(4): 453-485 (1997) |
| 1995 |
|---|
| 5 | | Jan Krajícek,
Pavel Pudlák,
Alan R. Woods:
An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle.
Random Struct. Algorithms 7(1): 15-40 (1995) |
| 1994 |
|---|
| 4 | EE | Jan Krajícek,
Pavel Pudlák,
Alan R. Woods:
An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
Electronic Colloquium on Computational Complexity (ECCC) 1(18): (1994) |
| 1993 |
|---|
| 3 | | P. T. Bateman,
Carl G. Jockusch Jr.,
Alan R. Woods:
Decidability and Undecidability of Theories with a Predicate for the Primes.
J. Symb. Log. 58(2): 672-687 (1993) |
| 1992 |
|---|
| 2 | | Paul Beame,
Russell Impagliazzo,
Jan Krajícek,
Toniann Pitassi,
Pavel Pudlák,
Alan R. Woods:
Exponential Lower Bounds for the Pigeonhole Principle
STOC 1992: 200-220 |
| 1988 |
|---|
| 1 | | Jeff B. Paris,
A. J. Wilkie,
Alan R. Woods:
Provability of the Pigeonhole Principle and the Existence of Infinitely Many Primes.
J. Symb. Log. 53(4): 1235-1244 (1988) |
