Richard Ryan Williams
Massachusetts Institute of Technology
H-index: 45
North America-United States
Top articles of Richard Ryan Williams
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Parallel Play Saves Quantifiers | arXiv preprint arXiv:2402.10293 | Marco Carmosino Ronald Fagin Neil Immerman Phokion Kolaitis Jonathan Lenchner | 2024/2/15 |
Constructive separations and their consequences | TheoretiCS | Lijie Chen Ce Jin Rahul Santhanam Ryan Williams | 2024/2/15 |
A VLSI circuit model accounting for wire delay | Ce Jin R Ryan Williams Nathaniel Young | 2024 | |
Towards stronger depth lower bounds | Gabriel Bathie R Ryan Williams | 2024 | |
Black-Box Constructive Proofs Are Unavoidable | Lijie Chen Ryan Williams Tianqi Yang | 2023 | |
Improved Merlin–Arthur protocols for central problems in fine-grained complexity | Algorithmica | Shyan Akmal Lijie Chen Ce Jin Malvika Raj Ryan Williams | 2023/8 |
On oracles and algorithmic methods for proving lower bounds | Nikhil Vyas Ryan Williams | 2023 | |
Faster Detours in Undirected Graphs | arXiv preprint arXiv:2307.01781 | Shyan Akmal Virginia Vassilevska Williams Ryan Williams Zixuan Xu | 2023/7/4 |
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic | Rahul Ilango Jiatu Li R Ryan Williams | 2023/6/2 | |
The Power of Constructing Bad Inputs | Bulletin of EATCS | Ryan Williams | 2023/2/22 |
Lower bounds against sparse symmetric functions of ACC circuits: Expanding the reach of# SAT algorithms | Theory of Computing Systems | Nikhil Vyas R Ryan Williams | 2023/2 |
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization | Lijie Chen Roei Tell Ryan Williams | 2023/11/6 | |
On the Number of Quantifiers as a Complexity Measure | arXiv preprint arXiv:2207.00104 | Ronald Fagin Jonathan Lenchner Nikhil Vyas Ryan Williams | 2022/6/30 |
Majority-3sat (and related problems) in polynomial time | Shyan Akmal Ryan Williams | 2022/2/7 | |
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions∗ | Lijie Chen Ce Jin R Ryan Williams Hongxun Wu | 2022 | |
Complexity Lower Bounds from Algorithm Design | R Ryan Williams | 2021/6/29 | |
On super strong ETH | Journal of Artificial Intelligence Research | Nikhil Vyas Ryan Williams | 2021/1/27 |
Black-Box Hypotheses and Lower Bounds | Brynmor K Chapman R Ryan Williams | 2021 | |
From Circuit Complexity to Faster All-Pairs Shortest Paths | SIAM Review | R Ryan Williams | 2021 |
Fast Low-Space Algorithms for Subset Sum | Ce Jin Nikhil Vyas Ryan Williams | 2021 |
Co-Authors
