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).
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
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
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
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.