| 2026 | MFCS | Beating Trivial Time for Tricky Triangle Tasks. | Neha Pant, Ryan Williams |
| 2026 | STOC | A Theory for Probabilistic Polynomial-Time Reasoning. | Lijie Chen, Jiatu Li, Igor C. Oliveira, Ryan Williams |
| 2025 | ESA | New Algorithms for Pigeonhole Equal Subset Sum. | Ce Jin, Ryan Williams, Stan Zhang |
| 2024 | FOCS | The Orthogonal Vectors Conjecture and Non-Uniform Circuit Lower Bounds. | Ryan Williams |
| 2024 | NSS | Enhancing Network Security Through Vulnerability Monitoring. | Ryan Williams, Anthony Gavazzi, Engin Kirda |
| 2024 | SP | Holepunch: Fast, Secure File Deletion with Crash Consistency. | Zachary Ratliff, Wittmann Goh, Abe Wieland, James Mickens, Ryan Williams |
| 2023 | ESA | Faster Detours in Undirected Graphs. | Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu |
| 2023 | FOCS | Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. | Lijie Chen, Roei Tell, Ryan Williams |
| 2022 | SecureComm | Breaking Embedded Software Homogeneity with Protocol Mutations. | Tongwei Ren, Ryan Williams, Sirshendu Ganguly, Lorenzo De Carli, Long Lu |
| 2021 | CHI | "Naked and on Fire": Examining Player Agency Experiences in Narrative-Focused Gameplay. | Eln Carstensdttir, Erica Kleinman, Ryan Williams, Magy Seif El-Nasr |
| 2021 | FOCS | MAJORITY-3SAT (and Related Problems) in Polynomial Time. | Shyan Akmal, Ryan Williams |
| 2021 | PLDI | Weldr: fusing binaries for simplified analysis. | Alexander Heinricher, Ryan Williams, Ava Klingbeil, Alex Jordan |
| 2021 | SODA | Fast Low-Space Algorithms for Subset Sum. | Ce Jin, Nikhil Vyas, Ryan Williams |
| 2020 | AAAI | Results on a Super Strong Exponential Time Hypothesis. | Nikhil Vyas, Ryan Williams |
| 2019 | ICALP | Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors. | Andreas Bjrklund, Ryan Williams |
| 2019 | ICALP | Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction. | Andreas Bjrklund, Petteri Kaski, Ryan Williams |
| 2019 | SODA | An Equivalence Class for Orthogonal Vectors. | Lijie Chen, Ryan Williams |
| 2018 | HCI | Evaluation of Visualization Heuristics. | Ryan Williams, Jean Scholtz, Leslie M. Blaha, Lyndsey Franklin, Zhuanyi Huang |
| 2018 | ISI | Incremental Hacker Forum Exploit Collection and Classification for Proactive Cyber Threat Intelligence: An Exploratory Study. | Ryan Williams, Sagar Samtani, Mark W. Patton, Hsinchun Chen |
| 2018 | SODA | On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity. | Ryan Williams |
| 2017 | ISI | Assessing medical device vulnerabilities on the Internet of Things. | Emma McMahon, Ryan Williams, Malaka El, Sagar Samtani, Mark W. Patton, Hsinchun Chen |
| 2017 | ISI | Identifying vulnerabilities of consumer Internet of Things (IoT) devices: A scalable approach. | Ryan Williams, Emma McMahon, Sagar Samtani, Mark W. Patton, Hsinchun Chen |
| 2016 | SODA | Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. | Timothy M. Chan, Ryan Williams |
| 2016 | STOC | 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 |
| 2016 | STOC | Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits. | Daniel M. Kane, Ryan Williams |
| 2015 | FOCS | Probabilistic Polynomials and Hamming Nearest Neighbors. | Josh Alman, Ryan Williams |
| 2015 | PODS | The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication. | Dirk Van Gucht, Ryan Williams, David P. Woodruff, Qin Zhang |
| 2014 | CSL | Faster decision of first-order graph properties. | Ryan Williams |
| 2014 | ESA | Losing Weight by Gaining Edges. | Amir Abboud, Kevin Lewi, Ryan Williams |
| 2014 | SODA | Finding orthogonal vectors in discrete structures. | Ryan Williams, Huacheng Yu |
| 2014 | STOC | New algorithms and lower bounds for circuits with linear threshold gates. | Ryan Williams |
| 2014 | STOC | Faster all-pairs shortest paths via circuit complexity. | Ryan Williams |
| 2013 | CSR | Towards NEXP versus BPP? | Ryan Williams |
| 2013 | STOC | Natural proofs versus derandomization. | Ryan Williams |
| 2011 | COCOON | Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory. | Ryan Williams |
| 2011 | PODS | Maximizing conjunctive views in deletion propagation. | Benny Kimelfeld, Jan Vondrk, Ryan Williams |
| 2011 | SAT | Connecting SAT Algorithms and Complexity Lower Bounds. | Ryan Williams |
| 2010 | FOCS | Subcubic Equivalences between Path, Matrix and Triangle Problems. | Virginia Vassilevska Williams, Ryan Williams |
| 2010 | ICALP | Resolving the Complexity of Some Data Privacy Problems. | Jeremiah Blocki, Ryan Williams |
| 2010 | SODA | On the Possibility of Faster SAT Algorithms. | Mihai Patrascu, Ryan Williams |
| 2010 | STOC | Improving exhaustive search implies superpolynomial lower bounds. | Ryan Williams |
| 2010 | STACS | Alternation-Trading Proofs, Linear Programming, and Lower Bounds. | Ryan Williams |
| 2009 | COCOON | An Improved Time-Space Lower Bound for Tautologies. | Scott Diehl, Dieter van Melkebeek, Ryan Williams |
| 2009 | FOCS | Regularity Lemmas and Combinatorial Algorithms. | Nikhil Bansal, Ryan Williams |
| 2009 | ICALP | Limits and Applications of Group Algebras for Parameterized Problems. | Ioannis Koutis, Ryan Williams |
| 2009 | STOC | Finding, minimizing, and counting weighted subgraphs. | Virginia Vassilevska, Ryan Williams |
| 2008 | ICALP | A New Combinatorial Approach for Sparse Graph Problems. | Guy E. Blelloch, Virginia Vassilevska, Ryan Williams |
| 2007 | SODA | Matrix-vector multiplication in sub-quadratic time: (some preprocessing required). | Ryan Williams |
| 2007 | STOC | All-pairs bottleneck paths for general graphs in truly sub-cubic time. | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
| 2006 | ICALP | Finding the Smallest | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
| 2006 | ISAIM | Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs. | Yannet Interian, Gabriel Corvera, Bart Selman, Ryan Williams |
| 2006 | SODA | Confronting hardness using a hybrid approach. | Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo |
| 2006 | STOC | Finding a maximum weight triangle in n | Virginia Vassilevska, Ryan Williams |
| 2005 | IUI | ComicKit: acquiring story scripts using common sense feedback. | Ryan Williams, Barbara Barry, Push Singh |
| 2005 | SPAA | Parallelizing time with polynomial circuits. | Ryan Williams |
| 2004 | ICALP | A New Algorithm for Optimal Constraint Satisfaction and Its Implications. | Ryan Williams |
| 2004 | PODS | On the Complexity of Optimal K-Anonymity. | Adam Meyerson, Ryan Williams |
| 2003 | IJCAI | Backdoors To Typical Case Complexity. | Ryan Williams, Carla P. Gomes, Bart Selman |
| 2003 | SAT | On Computing k-CNF Formula Properties. | Ryan Williams |
| 2002 | SODA | Algorithms for quantified Boolean formulas. | Ryan Williams |