Residence USA Doctoral advisor Manuel Blum Role Computer scientist | Name Ryan Williams Nationality American | |
 | ||
Institutions Carnegie Mellon University
IBM Almaden Research Center
Stanford University Alma mater Cornell University
Carnegie Mellon University Education Cornell University, Carnegie Mellon University Fields Computational complexity theory, Algorithm | ||
Complexity vidcast interview with ryan williams
Richard Ryan Williams, known as Ryan Williams (born 1979), is an American computer scientist working in computational complexity theory.
Contents
Education
Williams received his Ph.D in computer science in 2007 from Carnegie Mellon University under the supervision of Manuel Blum. From 2010 to 2012, he was a member of the Theory Group of IBM Almaden Research Center. From Fall 2011 to Fall 2016, he was a professor at Stanford University.. In January 2017, he joined the faculty at MIT [1].
Research
Williams has been a member of the program committee for the Symposium on Theory of Computing in 2011 and various other conferences. He won the Ron V. Book best student paper award at the IEEE Conference on Computational Complexity in 2005 and 2007, and at the best student paper award at the International Colloquium on Automata, Languages and Programming in 2004 from the European Association for Theoretical Computer Science.
Williams’s result that the complexity class NEXP is not contained in ACC0 received the best paper award at the Conference on Computational Complexity in 2011. Complexity theorist Scott Aaronson has called the result "one of the most spectacular of the decade".
Williams is also an expert on the computational complexity of k-anonymity.