Algorithms for quantified Boolean formulas. - Ryan Williams 001 (SODA, 2002)

Backdoors To Typical Case Complexity. - Ryan Williams 001; Carla P. Gomes; Bart Selman (IJCAI, 2003)

On Computing k-CNF Formula Properties. - Ryan Williams 001 (SAT, 2003)

On the Complexity of Optimal K-Anonymity. - Adam Meyerson; Ryan Williams 001 (PODS, 2004)

A new algorithm for optimal constraint satisfaction and its implications - Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2004)

Better Time-Space Lower Bounds for SAT and Related Problems. - Ryan Williams 001 (CCC, 2005)

A new algorithm for optimal 2-constraint satisfaction and its implications. - Ryan Williams 001 (Theor. Comput. Sci., 2005)

Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. - Virginia Vassilevska; Ryan Williams 001; Raphael Yuster (ICALP (1), 2006)

Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs. - Yannet Interian; Gabriel Corvera; Bart Selman; Ryan Williams 001 (AI&M, 2006)

Confronting hardness using a hybrid approach. - Virginia Vassilevska; Ryan Williams 001; Shan Leung Maverick Woo (SODA, 2006)

Finding a maximum weight triangle in n3-Delta time, with applications. - Virginia Vassilevska; Ryan Williams 001 (STOC, 2006)

Inductive Time-Space Lower Bounds for Sat and Related Problems. - Ryan Williams 001 (Comput. Complex., 2006)

Finding heaviest H-subgraphs in real weighted graphs, with applications - Virginia Vassilevska; Ryan Williams 001; Raphael Yuster (CoRR, 2006)

Matrix-vector multiplication in sub-quadratic time: (some preprocessing required). - Ryan Williams 001 (SODA, 2007)

All-pairs bottleneck paths for general graphs in truly sub-cubic time. - Virginia Vassilevska; Ryan Williams 001; Raphael Yuster (STOC, 2007)

08431 Open Problems - Moderately Exponential Time Algorithms. - Fedor V. Fomin; Kazuo Iwama; Dieter Kratsch; Petteri Kaski; Mikko Koivisto; Lukasz Kowalik; Yoshio Okamoto; Johan M. M. van Rooij; Ryan Williams 001 (Moderately Exponential Time Algorithms, 2008)

A New Combinatorial Approach for Sparse Graph Problems. - Guy E. Blelloch; Virginia Vassilevska; Ryan Williams 001 (ICALP (1), 2008)

Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. - R. Ryan Williams (Comput. Complex., 2008)

Finding paths of length k in O*(2^k) time - Ryan Williams 001 (CoRR, 2008)

Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas. - Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2008)

Applying practice to theory. - Ryan Williams 001 (SIGACT News, 2008)

Maximum Two-Satisfiability. - Ryan Williams 001 (Encyclopedia of Algorithms, 2008)

Fixed-Polynomial Size Circuit Bounds. - Lance Fortnow; Rahul Santhanam; Ryan Williams 001 (CCC, 2009)

Finding paths of length k in O*(2k) time. - Ryan Williams 001 (Inf. Process. Lett., 2009)

All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time. - Virginia Vassilevska; Ryan Williams 001; Raphael Yuster (Theory Comput., 2009)

Communication Complexity with Synchronized Clocks. - Russell Impagliazzo; Ryan Williams 001 (CCC, 2010)

Resolving the Complexity of Some Data Privacy Problems. - Jeremiah Blocki; Ryan Williams 001 (ICALP (2), 2010)

On the Possibility of Faster SAT Algorithms. - Mihai Patrascu; Ryan Williams 001 (SODA, 2010)

Improved Parameterized Algorithms for Constraint Satisfaction - Eun Jung Kim 002; Ryan Williams 001 (CoRR, 2010)

Finding heaviest H-subgraphs in real weighted graphs, with applications. - Virginia Vassilevska; Ryan Williams 001; Raphael Yuster (ACM Trans. Algorithms, 2010)

Non-uniform ACC Circuit Lower Bounds. - Ryan Williams 001 (CCC, 2011)

Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory. - Ryan Williams 001 (COCOON, 2011)

Improved Parameterized Algorithms for above Average Constraint Satisfaction. - Eun Jung Kim 002; Ryan Williams 001 (IPEC, 2011)

Connecting SAT Algorithms and Complexity Lower Bounds. - Ryan Williams 001 (SAT, 2011)

A Casual Tour Around a Circuit Complexity Bound - Ryan Williams 001 (CoRR, 2011)

An improved time-space lower bound for tautologies. - Scott Diehl; Dieter van Melkebeek; Ryan Williams 001 (J. Comb. Optim., 2011)

Parallelizing Time with Polynomial Circuits. - Ryan Williams 001 (Theory Comput. Syst., 2011)

Guest column: a casual tour around a circuit complexity bound. - Ryan Williams 001 (SIGACT News, 2011)

An Atypical Survey of Typical-Case Heuristic Algorithms - Lane A. Hemaspaandra; Ryan Williams 001 (CoRR, 2012)

Massive Online Teaching to Bounded Learners. - Brendan Juba; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2012)

Uniform Circuits, Lower Bounds, and QBF Algorithms. - Rahul Santhanam; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2012)

SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms. - Lane A. Hemaspaandra; Ryan Williams 001 (SIGACT News, 2012)

Regularity Lemmas and Combinatorial Algorithms. - Nikhil Bansal 001; Ryan Williams 001 (Theory Comput., 2012)

Maximizing Conjunctive Views in Deletion Propagation. - Benny Kimelfeld; Jan Vondrák; Ryan Williams 001 (ACM Trans. Database Syst., 2012)

On Medium-Uniformity and Circuit Lower Bounds. - Rahul Santhanam; Ryan Williams 001 (CCC, 2013)

Towards NEXP versus BPP? - Ryan Williams 001 (CSR, 2013)

Amplifying circuit lower bounds against polynomial time, with applications. - Richard J. Lipton; Ryan Williams 001 (Comput. Complex., 2013)

On the parameterized complexity of k-SUM. - Amir Abboud; Kevin Lewi; Ryan Williams 001 (CoRR, 2013)

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). - Thore Husfeldt; Ramamohan Paturi; Gregory B. Sorkin; Ryan Williams 001 (Dagstuhl Reports, 2013)

New Algorithms for QBF Satisfiability and Implications for Circuit Complexity. - Rahul Santhanam; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2013)

Improving Exhaustive Search Implies Superpolynomial Lower Bounds. - Ryan Williams 001 (SIAM J. Comput., 2013)

Finding, Minimizing, and Counting Weighted Subgraphs. - Virginia Vassilevska Williams; Ryan Williams 001 (SIAM J. Comput., 2013)

Alternation-Trading Proofs, Linear Programming, and Lower Bounds. - Ryan Williams 001 (ACM Trans. Comput. Theory, 2013)

Algorithms for Circuits and Circuits for Algorithms. - Ryan Williams 001 (CCC, 2014)

Faster decision of first-order graph properties. - Ryan Williams 001 (CSL-LICS, 2014)

Losing Weight by Gaining Edges. - Amir Abboud; Kevin Lewi; Ryan Williams 001 (ESA, 2014)

The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk). - Richard Ryan Williams (FSTTCS, 2014)

Finding orthogonal vectors in discrete structures. - Ryan Williams 001; Huacheng Yu (SODA, 2014)

On Uniformity and Circuit Lower Bounds. - Rahul Santhanam; Ryan Williams 001 (Comput. Complex., 2014)

On the (Non) NP-Hardness of Computing Circuit Complexity. - Cody Murray; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2014)

Nonuniform ACC Circuit Lower Bounds. - Ryan Williams 001 (J. ACM, 2014)

Thinking Algorithmically About Impossibility (Invited Talk). - R. Ryan Williams (CSL, 2015)

Probabilistic Polynomials and Hamming Nearest Neighbors. - Josh Alman; Ryan Williams 001 (FOCS, 2015)

The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data. - Brynmor Chapman; Ryan Williams 001 (ITCS, 2015)

The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication. - Dirk Van Gucht; Ryan Williams 001; David P. Woodruff; Qin Zhang 001 (PODS, 2015)

More Applications of the Polynomial Method to Algorithm Design. - Amir Abboud; Richard Ryan Williams; Huacheng Yu (SODA, 2015)

Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity. - Rahul Santhanam; Richard Ryan Williams (SODA, 2015)

Finding Four-Node Subgraphs in Triangle Time. - Virginia Vassilevska Williams; Joshua R. Wang; Richard Ryan Williams; Huacheng Yu (SODA, 2015)

Limits on Alternation Trading Proofs for Time-Space Lower Bounds. - Samuel R. Buss; Ryan Williams 001 (Comput. Complex., 2015)

Theory and Practice of SAT Solving (Dagstuhl Seminar 15171). - Armin Biere; Vijay Ganesh 001; Martin Grohe; Jakob Nordström; Ryan Williams 001 (Dagstuhl Reports, 2015)

Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits. - Daniel M. Kane; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2015)

Polynomial Representations of Threshold Functions and Algorithmic Applications. - Josh Alman; Timothy M. Chan; R. Ryan Williams (FOCS, 2016)

Deterministic Time-Space Trade-Offs for k-SUM. - Andrea Lincoln; Virginia Vassilevska Williams; Joshua R. Wang; R. Ryan Williams (ICALP, 2016)

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. - Amir Abboud; Thomas Dueholm Hansen; Virginia Vassilevska Williams; Ryan Williams 001 (STOC, 2016)

Algebraic fingerprints for faster algorithms. - Ioannis Koutis; Ryan Williams 001 (Commun. ACM, 2016)

Deterministic Time-Space Tradeoffs for k-SUM. - Andrea Lincoln; Virginia Vassilevska Williams; Joshua R. Wang; R. Ryan Williams (CoRR, 2016)

Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation. - Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2016)

Natural Proofs versus Derandomization. - R. Ryan Williams (SIAM J. Comput., 2016)

LIMITS and Applications of Group Algebras for Parameterized Problems. - Ioannis Koutis; Ryan Williams 001 (ACM Trans. Algorithms, 2016)

Exact Algorithms and Strong Exponential Time Hypothesis. - Joshua R. Wang; Richard Ryan Williams (Encyclopedia of Algorithms, 2016)

Exact Algorithms for Maximum Two-Satisfiability. - Ryan Williams 001 (Encyclopedia of Algorithms, 2016)

Easiness Amplification and Uniform Circuit Lower Bounds. - Cody D. Murray; R. Ryan Williams (CCC, 2017)

Distributed PCP Theorems for Hardness of Approximation in P. - Amir Abboud; Aviad Rubinstein; R. Ryan Williams (FOCS, 2017)

Faster Online Matrix-Vector Multiplication. - Kasper Green Larsen; R. Ryan Williams (SODA, 2017)

Beating Brute Force for Systems of Polynomial Equations over Finite Fields. - Daniel Lokshtanov; Ramamohan Paturi; Suguru Tamaki; R. Ryan Williams; Huacheng Yu (SODA, 2017)

Probabilistic rank and matrix rigidity. - Josh Alman; R. Ryan Williams (STOC, 2017)

On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity in Computational Geometry. - R. Ryan Williams (CoRR, 2017)

Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP. - Cody Murray; R. Ryan Williams (Electron. Colloquium Comput. Complex., 2017)

Some ways of thinking algorithmically about impossibility. - R. Ryan Williams (ACM SIGLOG News, 2017)

Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials. - Richard Ryan Williams (CCC, 2018)

Lower Bounds by Algorithm Design: A Progress Report (Invited Paper). - Richard Ryan Williams (ICALP, 2018)

Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. - Andrea Lincoln; Virginia Vassilevska Williams; R. Ryan Williams (SODA, 2018)

On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity. - Ryan Williams 001 (SODA, 2018)

Counting Solutions to Polynomial Systems via Reductions. - R. Ryan Williams (SOSA, 2018)

Subcubic Equivalences Between Path, Matrix, and Triangle Problems. - Virginia Vassilevska Williams; R. Ryan Williams (J. ACM, 2018)

Faster All-Pairs Shortest Paths via Circuit Complexity. - R. Ryan Williams (SIAM J. Comput., 2018)

New Algorithms and Lower Bounds for Circuits With Linear Threshold Gates. - R. Ryan Williams (Theory Comput., 2018)

Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. - Lijie Chen 001; R. Ryan Williams (CCC, 2019)

Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors. - Andreas Björklund; Ryan Williams 001 (ICALP, 2019)

Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. - Andreas Björklund; Petteri Kaski; Ryan Williams 001 (ICALP, 2019)

The Orthogonal Vectors Conjecture for Branching Programs and Formulas. - Daniel M. Kane; Richard Ryan Williams (ITCS, 2019)

Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle. - Dylan M. McKay; Richard Ryan Williams (ITCS, 2019)

An Equivalence Class for Orthogonal Vectors. - Lijie Chen 001; Ryan Williams 001 (SODA, 2019)

Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. - Dylan M. McKay; Cody D. Murray; R. Ryan Williams (STOC, 2019)

Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants. - Andreas Björklund; Petteri Kaski; Ryan Williams 001 (Algorithmica, 2019)

Hardness Magnification for all Sparse NP Languages. - Lijie Chen 001; Ce Jin 001; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2019)

Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. - Lijie Chen 001; Dylan M. McKay; Cody Murray; R. Ryan Williams (Electron. Colloquium Comput. Complex., 2019)

Completeness for First-order Properties on Sparse Structures with Algorithmic Applications. - Jiawei Gao 001; Russell Impagliazzo; Antonina Kolokolova; Ryan Williams 001 (ACM Trans. Algorithms, 2019)

Some Estimated Likelihoods for Computational Complexity. - R. Ryan Williams (Computing and Software Science, 2019)

Results on a Super Strong Exponential Time Hypothesis. - Nikhil Vyas 001; Ryan Williams 001 (AAAI, 2020)

Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions. - Josh Alman; Timothy M. Chan; R. Ryan Williams (SODA, 2020)

Sharp Threshold Results for Computational Complexity. - Lijie Chen 001; Ce Jin 001; R. Ryan Williams (Electron. Colloquium Comput. Complex., 2020)

Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. - Lijie Chen 001; Xin Lyu 002; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2020)

Lower bounds for the depth of modular squaring. - Benjamin Wesolowski; Ryan Williams 001 (IACR Cryptol. ePrint Arch., 2020)

Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma. - Cody D. Murray; R. Ryan Williams (SIAM J. Comput., 2020)

MAJORITY-3SAT (and Related Problems) in Polynomial Time. - Shyan Akmal; Ryan Williams 001 (FOCS, 2021)

Circuit Depth Reductions. - Alexander Golovnev; Alexander S. Kulikov; R. Ryan Williams (ITCS, 2021)

Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers. - Abhijit Mudigonda; R. Ryan Williams (ITCS, 2021)

Complexity Lower Bounds from Algorithm Design. - R. Ryan Williams (LICS, 2021)

Black-Box Hypotheses and Lower Bounds. - Brynmor Chapman; R. Ryan Williams (MFCS, 2021)

Fast Low-Space Algorithms for Subset Sum. - Ce Jin 001; Nikhil Vyas 001; Ryan Williams 001 (SODA, 2021)

Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. - Shyan Akmal; Lijie Chen 001; Ce Jin 001; Malvika Raj; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2021)

Constructive Separations and Their Consequences. - Lijie Chen 001; Ce Jin 001; Rahul Santhanam; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2021)

On Super Strong ETH. - Nikhil Vyas 001; R. Ryan Williams (J. Artif. Intell. Res., 2021)

From Circuit Complexity to Faster All-Pairs Shortest Paths. - R. Ryan Williams (SIAM Rev., 2021)

Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. - Timothy M. Chan; R. Ryan Williams (ACM Trans. Algorithms, 2021)

Smaller ACC0 Circuits for Symmetric Functions. - Brynmor Chapman; R. Ryan Williams (ITCS, 2022)

On the Number of Quantifiers as a Complexity Measure. - Ronald Fagin; Jonathan Lenchner; Nikhil Vyas 001; R. Ryan Williams (MFCS, 2022)

Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. - Lijie Chen 001; Ce Jin 001; R. Ryan Williams; Hongxun Wu (SODA, 2022)

Faster Detours in Undirected Graphs. - Shyan Akmal; Virginia Vassilevska Williams; Ryan Williams 001; Zixuan Xu (ESA, 2023)

Black-Box Constructive Proofs Are Unavoidable. - Lijie Chen 001; Ryan Williams 001; Tianqi Yang 001 (ITCS, 2023)

The Power of Constructing Bad Inputs. - Ryan Williams 001 (Bull. EATCS, 2023)

A VLSI Circuit Model Accounting For Wire Delay. - Ce Jin 001; Ryan Williams 001; Nathaniel Young (Electron. Colloquium Comput. Complex., 2023)

Self-Improvement for Circuit-Analysis Problems. - Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2023)

Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. - Lijie Chen 001; Roei Tell; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2023)

Towards Stronger Depth Lower Bounds. - Gabriel Bathie; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2023)

Beating Brute Force for Compression Problems. - Shuichi Hirahara; Rahul Ilango; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2023)

Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. - Rahul Ilango; Jiatu Li; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2023)

Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. - Nikhil Vyas 001; R. Ryan Williams (Theory Comput. Syst., 2023)

Parallel Play Saves Quantifiers. - Marco Carmosino; Ronald Fagin; Neil Immerman; Phokion G. Kolaitis; Jonathan Lenchner; Rik Sengupta; R. Ryan Williams (CoRR, 2024)

On Oracles and Algorithmic Methods for Proving Lower Bounds. - Nikhil Vyas 001; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2024)

The Orthogonal Vectors Conjecture and Non-Uniform Circuit Lower Bounds. - Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2024)

Sparsity Lower Bounds for Probabilistic Polynomials. - Josh Alman; Arkadev Chattopadhyay; Ryan Williams 001 (ITCS, 2025)

Simulating Time in Square-Root Space. - Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2025)

When Connectivity Is Hard, Random Walks Are Easy With Non-Determinism. - Dean Doron; Edward Pyne; Roei Tell; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2025)