Alan R. Woods

709 total citations
16 papers, 378 citations indexed

About

Alan R. Woods is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Mathematical Physics. According to data from OpenAlex, Alan R. Woods has authored 16 papers receiving a total of 378 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 7 papers in Artificial Intelligence and 5 papers in Mathematical Physics. Recurrent topics in Alan R. Woods's work include Complexity and Algorithms in Graphs (6 papers), semigroups and automata theory (5 papers) and Computability, Logic, AI Algorithms (3 papers). Alan R. Woods is often cited by papers focused on Complexity and Algorithms in Graphs (6 papers), semigroups and automata theory (5 papers) and Computability, Logic, AI Algorithms (3 papers). Alan R. Woods collaborates with scholars based in Australia, United States and Czechia. Alan R. Woods's co-authors include J. B. Paris, A. J. Wilkie, Toniann Pitassi, Russell Impagliazzo, Pavel Pudlák, Jan Krajı́ček, Paul Beame, Danièle Gardy, Petr Savický and Paul T. Bateman and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Proceedings of the London Mathematical Society.

In The Last Decade

Alan R. Woods

16 papers receiving 336 citations

Peers

Countries citing papers authored by Alan R. Woods

Since Specialization

Citations

This map shows the geographic impact of Alan R. Woods's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Alan R. Woods with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alan R. Woods more than expected).

Fields of papers citing papers by Alan R. Woods

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Alan R. Woods. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Alan R. Woods. The network helps show where Alan R. Woods may publish in the future.

Co-authorship network of co-authors of Alan R. Woods

This figure shows the co-authorship network connecting the top 25 collaborators of Alan R. Woods. A scholar is included among the top collaborators of Alan R. Woods based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Alan R. Woods. Alan R. Woods is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

16 of 16 papers shown

#	Work	Indexed citations
1	And/or tree probabilities of Boolean functions 2005 ·Discrete Mathematics & Theoretical Computer Science ·Danièle Gardy, Alan R. Woods	11
2	Subset sum “cubes” and the complexity of primality testing 2004 ·Theoretical Computer Science ·Alan R. Woods	4
3	A New Proof of the Weak Pigeonhole Principle 2002 ·Journal of Computer and System Sciences ·(unknown), Toniann Pitassi, Alan R. Woods	25
4	Unsatisfiable systems of equations, over a finite field 2002 ·Alan R. Woods	2
5	A new proof of the weak pigeonhole principle 2000 ·(unknown), Toniann Pitassi, Alan R. Woods	39
6	The number of Boolean functions computed by formulas of a given size 1998 ·Random Structures and Algorithms ·Petr Savický, Alan R. Woods	12
7	Coloring rules for finite trees, and probabilities of monadic second order sentences 1997 ·Random Structures and Algorithms ·Alan R. Woods	7
8	Coloring rules for finite trees, and probabilities of monadic second order sentences 1997 ·Random Structures and Algorithms ·Alan R. Woods	30
9	Counting finite models 1997 ·Journal of Symbolic Logic ·Alan R. Woods	4
10	An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle 1995 ·Random Structures and Algorithms ·Jan Krajı́ček, Pavel Pudlák, Alan R. Woods	2
11	Maximal Subgroups of Infinite Symmetric Groups 1994 ·Proceedings of the London Mathematical Society ·Marcus Brazil, (unknown), Tim Penttila, Cheryl E. Praeger, Alan R. Woods	6
12	Decidability and undecidability of theories with a predicate for the primes 1993 ·Journal of Symbolic Logic ·Paul T. Bateman, (unknown), Alan R. Woods	10
13	Exponential lower bounds for the pigeonhole principle 1992 ·Paul Beame, Russell Impagliazzo, Jan Krajı́ček, Toniann Pitassi, Pavel Pudlák, Alan R. Woods	57
14	Provability of the pigeonhole principle and the existence of infinitely many primes 1988 ·Journal of Symbolic Logic ·J. B. Paris, A. J. Wilkie, Alan R. Woods	80
15	Provability of the pigeonhole principle and the existence of infinitely many primes 1988 ·Journal of Symbolic Logic ·J. B. Paris, A. J. Wilkie, Alan R. Woods	40
16	Some problems in logic and number theory and their connections 1981 ·Medical Entomology and Zoology ·Alan R. Woods	49

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact