See How Your Research Aligns
Create a free account to analyze your research alignment,
identify potential research gaps, and generate personalized
application documents for this professor.
Create Free Account
Ryan Williams
Algorithm Design
Computational Complexity Theory
Algorithmic Lower Bounds
Memory-Efficient Algorithms
Computational Reductions
About
In general, I try to understand what is easy and what is hard to compute, independently of any particular computer. I work in algorithm design and complexity theory, and I especially like connections between the two subjects. I think about many questions, but a few of them haunt me more than others. Some examples:
Can the existence of an algorithm for a problem be used to prove that other algorithms cannot exist for other problems? Can the nonexistence of algorithms be used to prove that another algorithm correctly solves a problem? (In fact, there are "yes" answers to both questions!)
Does every function implementable with a low memory footprint also have a fast implementation
Research Performance Summary
2000-2026
Active Research Span
First Recorded Paper
Space-efficient reversible simulations
Year:
2000
Citations:
12
Venue:
DIMACS REU report
Latest Recorded Paper
Comment on “SAT requires exhaustive search”
Year:
2026
Citations:
1
Venue:
Frontiers of Computer Science 20 (1)
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.
Publication Venues and Collaboration
Journal, Conference, and Book Publication Breakdown
Top Coauthors
Williams
Chen
Jin
Research Impact by Period
Papers
6
Citations
33
Avg. Citations / Paper
5.5
H-Index
2
Papers
28
Citations
343
Avg. Citations / Paper
12.2
H-Index
13
Papers
47
Citations
3742
Avg. Citations / Paper
79.6
H-Index
32
Papers
30
Citations
1753
Avg. Citations / Paper
58.4
H-Index
19
Papers
24
Citations
1871
Avg. Citations / Paper
78
H-Index
15
Papers
9
Citations
1995
Avg. Citations / Paper
221.7
H-Index
7
Contact and Professional Links
Detected Research Keywords
Circuit Lower Bounds
Time Space Lower
Space Lower Bounds
Quantified Boolean Formulas
Faster All Pairs
All Pairs Shortest
Pairs Shortest Paths
Beating Brute Force
Systems Polynomial Equations
Lower Bounds Depth