Ryan Williams (computer scientist)

Richard Ryan Williams, known as Ryan Williams (born 1979), is an American computer scientist working in computational complexity theory.

Ryan Williams
Williams (November 2010)
Born1979 (age 40–41)
NationalityAmerican
Alma materCornell University
Carnegie Mellon University
Scientific career
FieldsComputational complexity theory, Algorithms
InstitutionsCarnegie Mellon University
IBM Almaden Research Center
Stanford University
Doctoral advisorManuel Blum

Education

Williams received his Bachelor's degree in math and computer science from Cornell University in 2001[1] and his Ph.D in computer science in 2007 from Carnegie Mellon University under the supervision of Manuel Blum.[2] 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 .

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,[3] 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.[4]

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.[5] Complexity theorist Scott Aaronson has called the result "one of the most spectacular of the decade".[6]

Williams is also an expert on the computational complexity of k-anonymity.[7]

Personal life

Ryan is married to Virginia Vassilevska Williams, also a computer scientist.

Selected publications
  • Meyerson, Adam; Williams, Ryan (2004), "On the complexity of optimal k-anonymity", Proceedings of the Twenty-third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS '04), New York, NY, USA: ACM, pp. 223–228, doi:10.1145/1055558.1055591, ISBN 978-1581138580
  • Williams, R. (2005), "Better Time-Space Lower Bounds for SAT and Related Problems", IEEE Conference on Computational Complexity (CCC), pp. 40–49
  • Williams, R. (2005), "A New Algorithm for Optimal 2-Constraint Satisfaction and Its Implications", Theoretical Computer Science, 348 (2–3): 357–365, doi:10.1016/j.tcs.2005.09.023
  • Williams, R. (2008), "Time-Space Lower Bounds for Counting NP Solutions Modulo Integers", Computational Complexity, 17 (2): 179–219, doi:10.1007/s00037-008-0248-y
  • Williams, R. (2011), "Non-Uniform ACC Circuit Lower Bounds", IEEE Conference on Computational Complexity (CCC) (PDF), pp. 115–125, CiteSeerX 10.1.1.225.8935, doi:10.1109/CCC.2011.36, ISBN 978-1-4577-0179-5
gollark: So, apart from the fact that for some reason some slots don't actually fill themselves when crafting (why?!) it mostly works.
gollark: Is it particularly type-safe?
gollark: I am seriously considering it.
gollark: Basically, it seems very much as if stuff autocrafts, then it vanishes.
gollark: I've probably managed to do the first successful autolosing of items.

References
  1. Curriculum vitae (PDF), retrieved 2017-12-02
  2. Ryan Williams at the Mathematics Genealogy Project
  3. Proceedings of 20th Annual IEEE Conference on Computational Complexity (CCC'05) San Jose, CA June 11-June 15, ISBN 0-7695-2364-1, and Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) San Diego, California, June 13-March 16, ISBN 0-7695-2780-9.
  4. "Best Student ICALP Paper". European Association for Theoretical Computer Science (EATCS).
  5. Program for CCC2011 at http://computationalcomplexity.org/
  6. Aaronson, Scott (November 8, 2010), "State of circuit lower bounds now slightly less humiliating", MIT Technology Review.
  7. Meyerson & Williams (2004).
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.