default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan R. Woods
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2009
[j9]Charalampos Cornaros, Alan R. Woods:
On bounded arithmetic augmented by the ability to count certain sets of primes. J. Symb. Log. 74(2): 455-473 (2009)- 2004
- [j8]Alan R. Woods:
Subset sum "cubes" and the complexity of primality testing. Theor. Comput. Sci. 322(1): 203-219 (2004) - 2002
- [j7]Alexis Maciel, Toniann Pitassi, Alan R. Woods:
A New Proof of the Weak Pigeonhole Principle. J. Comput. Syst. Sci. 64(4): 843-872 (2002) - 1998
- [j6]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
- [j5]Alan R. Woods:
Counting Finite Models. J. Symb. Log. 62(3): 925-949 (1997) - [j4]Alan R. Woods:
Coloring rules for finite trees, and probabilities of monadic second order sentences. Random Struct. Algorithms 10(4): 453-485 (1997) - 1995
- [j3]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) - 1993
- [j2]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) - 1988
- [j1]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)
Conference and Workshop Papers
- 2012
- [c5]Andreas Weiermann
, Alan R. Woods:
Some Natural Zero One Laws for Ordinals Below ε 0. CiE 2012: 723-732 - 2000
- [c4]Alexis Maciel, Toniann Pitassi, Alan R. Woods:
A new proof of the weak pigeonhole principle. STOC 2000: 368-377 - 1998
- [c3]Alan R. Woods:
Unsatisfiable Systems of Equations, Over a Finite Field. FOCS 1998: 202-211 - 1995
- [c2]Alan R. Woods:
Approximating the structures accepted by a constant depth circuit or satisfying a sentence-a nonstandard approach. Logic and Random Structures 1995: 109-130 - 1992
- [c1]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
Informal and Other Publications
- 1994
- [i1]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. Electron. Colloquium Comput. Complex. TR94 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
