Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Ryan Williams'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 Ryan Williams with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ryan Williams more than expected).
This network shows the impact of papers produced by Ryan Williams. 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 Ryan Williams. The network helps show where Ryan Williams may publish in the future.
Co-authorship network of co-authors of Ryan Williams
This figure shows the co-authorship network connecting the top 25 collaborators of Ryan Williams.
A scholar is included among the top collaborators of Ryan Williams 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 Ryan Williams. Ryan Williams is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Williams, Ryan. (2018). . Theory of Computing. 14(1). 1–25.7 indexed citations
6.
Williams, Ryan, et al.. (2017). . Theory of Computing. 13(1). 1–22.20 indexed citations
7.
Williams, Virginia Vassilevska, Joshua R. Wang, Ryan Williams, & Huacheng Yu. (2015). Finding four-node subgraphs in triangle time. Symposium on Discrete Algorithms. 1671–1680.10 indexed citations
Vassilevska, Virginia, Ryan Williams, & Raphael Yuster. (2006). Finding the smallest H-subgraph in real weighted graphs and related problems.4 indexed citations
Williams, Ryan, Carla P. Gomes, & Bart Selman. (2003). Backdoors to typical case complexity. International Joint Conference on Artificial Intelligence. 1173–1178.128 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.