To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

How to transfigure the Wikipedia

Would you like Wikipedia to always look as professional and up-to-date? We have created a browser extension. It will enhance any encyclopedic page you visit with the magic of the WIKI 2 technology.

Try it — you can delete it anytime.

Install in 5 seconds
4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
Great Wikipedia has got greater.
.
Leo
Newton
Brights
Milds

Ryan Williams (computer scientist)

From Wikipedia, the free encyclopedia

For other people named Ryan Williams, see Ryan Williams (disambiguation).
Ryan Williams
Williams (November 2010)
Born1979 (age 44–45)
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

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

YouTube Encyclopedic

  • 1/5
    Views:
    1 953
    651
    612
    531
    4 522
  • Circuit Lower Bounds from Algorithm Design: An Overview I (Partial)
  • Ryan Williams: Backdoors to Typical Case Complexity
  • ICM2014 VideoSeries IL14.7: Ryan Williams on Aug19Tue
  • Genomic Data Analysis with Spark & Hadoop by Ryan Williams | DataEngConf NYC '16
  • Thinking Algorithmically About Impossibility

Transcription

Education

Williams graduated from the Alabama School of Mathematics and Science before receiving 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.[3]

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

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.[6] Complexity theorist Scott Aaronson has called the result "one of the most spectacular of the decade".[7] In 2024, for this work Williams was awarded Gödel Prize.

Williams has also worked on the computational complexity of k-anonymity.[8]

Personal life

Ryan is married to Virginia Vassilevska Williams, also a theoretical 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, S2CID 6798963
  • 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, S2CID 8815358
  • 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, S2CID 7020039

References

  1. ^ Curriculum vitae (PDF), retrieved 2017-12-02
  2. ^ Ryan Williams at the Mathematics Genealogy Project
  3. ^ "Ryan Williams | MIT CSAIL Theory of Computation". toc.csail.mit.edu. Retrieved 2021-12-18.
  4. ^ 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.
  5. ^ "Best Student ICALP Paper". European Association for Theoretical Computer Science (EATCS).
  6. ^ Program for CCC2011 at http://computationalcomplexity.org/
  7. ^ Aaronson, Scott (November 8, 2010), "State of circuit lower bounds now slightly less humiliating", MIT Technology Review.
  8. ^ Meyerson & Williams (2004).

External links

This page was last edited on 27 May 2024, at 09:49
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.
Contact WIKI 2
Introduction
Terms of Service
Privacy Policy