Ryan Williams

5.5k citations
109 papers · 2.2k indexed · 1 hit paper · h-index 21

Impact in

Papers in

    • Complexity and Algorithms in Graphs 84
    • Advanced Graph Theory Research 42
    • semigroups and automata theory 19
    • Formal Methods in Verification 10
    • Machine Learning and Algorithms 29
    • Cryptography and Data Security 19
    • Algorithms and Data Compression 11

Ryan Williams

102 papers receiving 2.0k citations

Hit Papers

On the complexity of optimal K-anonymity 2004 · 502 citations
5020+7+14Years since publication100200300400500

Peers

Ryan Williams
Comparison fields: 5 of 86
  • Computational Theory and Mathematics 1.2k
  • Artificial Intelligence 1.3k
  • Computer Graphics and Computer-Aided Design 82
  • Computer Networks and Communications 474
  • Discrete Mathematics and Combinatorics 64
Replace Jin‐Yi Cai with:
Jin‐Yi Cai United States
Ryan O’Donnell United States
Rocco A. Servedio United States
David R. Musser United States
Subhash Khot United States
Aviezri S. Fraenkel Israel
Nir Ailon United States
George Labahn Canada
Milena Mihail United States
Ker‐I Ko United States
Ryan Williams relative to Jin‐Yi Cai United States Jin‐Yi Cai's profile →
Citations per field
00.5×2.6×
Jin‐Yi Cai · 1×
Citations per year

Countries citing papers authored by Ryan Williams

Since Specialization
Citations

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

Fields of papers citing papers by Ryan Williams

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authors

The 25 scholars most cited alongside Ryan Williams, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Ryan Williams Line = papers co-authored together Ryan Williams links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 109 papers — load more, or switch the sort, to bring in the rest.

#Work
1
On the complexity of optimal K-anonymity
Hit paper breakdown →
2004502
2 2005140
3
Backdoors to typical case complexity
2003128
4 201091
5 200881
6 201468
7 201367
8 201461
9 201157
10 201849
11 200943
12 201037
13 201834
14 201331
15 201430
16 200724
17 201023
18 201623
19 200721
20 201721

About Ryan Williams

Ryan Williams is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design, having authored 109 papers that have together received 2.2k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (84 papers), Advanced Graph Theory Research (42 papers), Machine Learning and Algorithms (29 papers), Cryptography and Data Security (19 papers), semigroups and automata theory (19 papers), Optimization and Search Problems (11 papers), Algorithms and Data Compression (11 papers) and Formal Methods in Verification (10 papers). The work is most often cited by research in Computational Theory and Mathematics (1.2k citations), Artificial Intelligence (1.3k citations), Computer Graphics and Computer-Aided Design (82 citations), Computer Networks and Communications (474 citations) and Discrete Mathematics and Combinatorics (64 citations). Ryan Williams has collaborated with scholars based in United States, Canada and China. Frequent co-authors include Adam Meyerson, Virginia Vassilevska Williams, Virginia Vassilevska, Bart Selman, Carla P. Gomes, Raphael Yuster, Nikhil Bansal, Huacheng Yu, Mihai Pǎtraşcu and Russell Impagliazzo. Their work appears in journals such as SIAM Journal on Computing, Computational Complexity, Theory of Computing, ACM Transactions on Algorithms and Algorithmica.

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