(Click on the dots to get my email.)
Previously I was in the Theory Group at IBM Almaden, supported by the Josef Raviv Fellowship. Before that I was a member of the School of Mathematics at the Institute for Advanced Study in Princeton, NJ.
|Tweets by @rrwilliams|
|Teaching in Fall 2016: CS254|
Past Teaching at Stanford:
Research InterestsI work in algorithm design and complexity theory, and especially connections between the two subjects. I think about many questions, but a few of them haunt me more than others. Can the existence of an algorithm for a problem be used to prove that other algorithms cannot exist? Can the nonexistence of algorithms be used to prove that another algorithm correctly solves a problem? (In fact, there are "yes" answers to both questions.) Does every function implementable with a low memory footprint also have a fast implementation? (Is $P = PSPACE$?) Could computers themselves help us make progress on answering these questions?
About MeI grew up near the big city of Somerville, Alabama, where there is good fishing in the water and good football on the radio. Further south in Alabama there is a good school for math and science.