Ryan Williams

Professor, Massachusetts Institute of Technology
Ryan Williams is a Professor at MIT in the Department of Electrical Engineering and Computer Science. Ryan got a PhD from CMU under Manuel Blum. He was an Assistant Professor at Stanford, then and an Associate Professor at MIT. Ryan works in the design and analysis of efficient algorithms and computational complexity theory. He is especially interested in relationships between the existence of non-trivial algorithms and proofs of complexity lower bounds. Ryan is also interested in theoretical topics that help give scientific explanations for computational phenomena, such as the unreasonable effectiveness of SAT solvers in practice.

Program Visits

Logic and Algorithms in Database Theory and AI, Fall 2023, Visiting Scientist
Meta-Complexity, Spring 2023, Visiting Scientist
Extended Reunion: Satisfiability, Spring 2023, Visiting Scientist
Satisfiability: Theory, Practice, and Beyond, Spring 2021, Visiting Scientist
Lower Bounds in Computational Complexity, Fall 2018, Visiting Scientist and Program Organizer
Fine-Grained Complexity and Algorithm Design, Fall 2015, Visiting Scientist and Program Organizer
complexity theory, fine-grained algorithms, meta-everything