The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alan R. Woods: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002