Ryan Williams (computer scientist)
Encyclopedia
Richard Ryan Williams is an American
computer scientist working in computational complexity
theory.
under the supervision of Manuel Blum
. As of 2010, he is a member of the Theory Group of IBM Almaden Research Center. Starting Fall 2011, he'll be a professor at Stanford University.
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".
United States
The United States of America is a federal constitutional republic comprising fifty states and a federal district...
computer scientist working in computational complexity
Computational Complexity
Computational Complexity may refer to:*Computational complexity theory*Computational Complexity...
theory.
Education
Williams received his Ph.D in computer science in 2007 from Carnegie Mellon UniversityCarnegie Mellon University
Carnegie Mellon University is a private research university in Pittsburgh, Pennsylvania, United States....
under the supervision of Manuel Blum
Manuel Blum
Manuel Blum is a computer scientist who received the Turing Award in 1995 "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking".-Biography:Blum attended MIT, where he received his bachelor's degree and...
. As of 2010, he is a member of the Theory Group of IBM Almaden Research Center. Starting Fall 2011, he'll be a professor at Stanford University.
Research
Williams is a member of the programme committee for the Symposium on Theory of ComputingSymposium on Theory of Computing
STOC, the Annual ACM Symposium on Theory of Computing is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computer Machinery special interest group SIGACT.As...
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
International Colloquium on Automata, Languages and Programming
ICALP, the International Colloquium on Automata, Languages and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe...
in 2004 from the European Association for Theoretical Computer Science.
Williams’s result that the complexity class NEXP
NEXPTIME
In computational complexity theory, the complexity class NEXPTIME is the set of decision problems that can be solved by a non-deterministic Turing machine using time O for some polynomial p, and unlimited space....
is not contained in ACC0 received the best paper award at the Conference on Computational Complexity in 2011. Complexity theorist Scott Aaronson
Scott Aaronson
Scott Joel Aaronson is a theoretical computer scientist and faculty member in the Electrical Engineering and Computer Science department at the Massachusetts Institute of Technology.-Education:...
has called the result "one of the most spectacular of the decade".
External links
- Ryan William’s homepage at Carnegie Mellon UniversityCarnegie Mellon UniversityCarnegie Mellon University is a private research university in Pittsburgh, Pennsylvania, United States....