William Gasarch

1.9k total citations
83 papers, 845 citations indexed

About

William Gasarch is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, William Gasarch has authored 83 papers receiving a total of 845 indexed citations (citations by other indexed papers that have themselves been cited), including 64 papers in Computational Theory and Mathematics, 51 papers in Artificial Intelligence and 8 papers in Computer Networks and Communications. Recurrent topics in William Gasarch's work include Computability, Logic, AI Algorithms (37 papers), Algorithms and Data Compression (27 papers) and Machine Learning and Algorithms (23 papers). William Gasarch is often cited by papers focused on Computability, Logic, AI Algorithms (37 papers), Algorithms and Data Compression (27 papers) and Machine Learning and Algorithms (23 papers). William Gasarch collaborates with scholars based in United States, Germany and Israel. William Gasarch's co-authors include Richard Beigel, Carl H. Smith, Amihood Amir, Mark G. Pleszkoch, John Gill, Lance Fortnow, Steven Homer, Clyde P. Kruskal, Dana Angluin and Louise Hay and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

William Gasarch

70 papers receiving 781 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
William Gasarch United States 12 603 529 134 78 45 83 845
Walter J. Savitch United States 14 612 1.0× 752 1.4× 194 1.4× 151 1.9× 62 1.4× 55 1.2k
Jacobo Torán Germany 15 516 0.9× 721 1.4× 153 1.1× 52 0.7× 28 0.6× 56 989
Joel Seiferas United States 15 525 0.9× 517 1.0× 186 1.4× 163 2.1× 42 0.9× 47 827
Nader H. Bshouty Israel 18 872 1.4× 536 1.0× 166 1.2× 43 0.6× 76 1.7× 123 1.1k
Johannes Köbler Germany 13 465 0.8× 632 1.2× 120 0.9× 45 0.6× 18 0.4× 59 847
悦朗 守屋 United Kingdom 2 487 0.8× 527 1.0× 120 0.9× 148 1.9× 36 0.8× 4 815
György Turán United States 12 519 0.9× 443 0.8× 95 0.7× 31 0.4× 18 0.4× 53 726
Michael J. Dinneen New Zealand 15 361 0.6× 413 0.8× 178 1.3× 133 1.7× 26 0.6× 80 791
Adam R. Klivans United States 19 831 1.4× 618 1.2× 108 0.8× 35 0.4× 16 0.4× 56 1.0k
Eric Allender United States 20 802 1.3× 1.2k 2.2× 180 1.3× 36 0.5× 22 0.5× 117 1.4k

Countries citing papers authored by William Gasarch

Since Specialization
Citations

This map shows the geographic impact of William Gasarch'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 William Gasarch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites William Gasarch more than expected).

Fields of papers citing papers by William Gasarch

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by William Gasarch. 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 William Gasarch. The network helps show where William Gasarch may publish in the future.

Co-authorship network of co-authors of William Gasarch

This figure shows the co-authorship network connecting the top 25 collaborators of William Gasarch. A scholar is included among the top collaborators of William Gasarch 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 William Gasarch. William Gasarch is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gasarch, William. (2021). Hilbert’s Tenth Problem for Fixed d and n. Bulletin of the European Association for Theoretical Computer Science. 133(133). 2 indexed citations
2.
Beigel, Richard & William Gasarch. (2015). On the sizes of DPDAs, PDAs, LBAs. Theoretical Computer Science. 638. 63–75.
3.
Longpré, Luc, William Gasarch, G. William Walster, & Владик Крейнович. (2007). m solutions good, m-1 solutions better. Applied mathematical sciences. 2(5). 223–239. 2 indexed citations
4.
Gasarch, William, et al.. (2007). Finding large 3-free sets I: The small n case. Journal of Computer and System Sciences. 74(4). 628–655. 7 indexed citations
5.
Gasarch, William, Evan Golub, & Aravind Srinivasan. (2003). When does a random Robin Hood win?. Theoretical Computer Science. 304(1-3). 477–484.
6.
Gasarch, William, Evan Golub, & Clyde P. Kruskal. (2003). Constant time parallel sorting: an empirical view. Journal of Computer and System Sciences. 67(1). 63–91. 2 indexed citations
7.
Gasarch, William, et al.. (2002). Automata techniques for query inference machines. Annals of Pure and Applied Logic. 117(1-3). 169–201. 1 indexed citations
8.
Beigel, Richard, et al.. (2000). The Complexity of Odd$^A_n$. Journal of Symbolic Logic. 65(1). 1–18. 1 indexed citations
9.
Gasarch, William, Evan Golub, & Clyde P. Kruskal. (2000). A Survey of Constant Time Parallel Sorting.. Bulletin of the European Association for Theoretical Computer Science. 72. 84–102. 4 indexed citations
10.
Beals, Robert, Richard Chang, William Gasarch, & Jacobo Torán. (1999). On Finding the Number of Graph Automorphisms.. 1999. 3 indexed citations
11.
Gasarch, William, et al.. (1998). Implementing WS1S via Finite Automata. 1 indexed citations
12.
Gasarch, William, et al.. (1998). On the finiteness of the recursive chromatic number. Annals of Pure and Applied Logic. 93(1-3). 73–81. 2 indexed citations
13.
Fortnow, Lance, William Gasarch, Martin Kummer, et al.. (1998). On the relative sizes of learnable sets. Theoretical Computer Science. 197(1-2). 139–156. 4 indexed citations
14.
Downey, Rod, et al.. (1994). The structure of the honest polynomial m-degrees. Annals of Pure and Applied Logic. 70(2). 113–139. 1 indexed citations
15.
Beigel, Richard, et al.. (1993). Terse, Superterse, and Verbose Sets. Information and Computation. 103(1). 68–85. 37 indexed citations
16.
Gasarch, William, Mark G. Pleszkoch, & Robert M Solovay. (1990). Learning via queries in. Conference on Learning Theory. 338–351. 1 indexed citations
17.
Gasarch, William & Mark G. Pleszkoch. (1989). Learning via queries to an oracle. Conference on Learning Theory. 214–229. 21 indexed citations
18.
Angluin, Dana, William Gasarch, & Carl H. Smith. (1989). Training sequences. Theoretical Computer Science. 66(3). 255–272. 11 indexed citations
19.
Gasarch, William & Carl H. Smith. (1988). Learning via queries. Conference on Learning Theory. 227–241. 6 indexed citations
20.
Amir, Amihood & William Gasarch. (1987). Polynomial Terse Sets (Extended Abstract). 22–27. 1 indexed citations

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

Rankless by CCL
2026