## Home

Mikefest Presentation [PPT] by Tom Mrowka and Michel Goemans

This symposium will feature a number of leaders in theoretical computer science, giving their perspective on past, present and future research, particularly in computational complexity, an area shaped by the research of Michael Sipser, whom we will honor at a banquet to end the day.

Michael Sipser is the Barton L. Weller Professor of Mathematics and Dean of Science at the Massachusetts Institute of Technology. Sipser received his PhD from UC Berkeley in 1980 under the supervision of Manuel Blum. His work in computational complexity set new directions in computer science, creating the field of circuit complexity and bringing the tools of complexity to bear on pseudorandomness and interactive proofs. He helped champion the P versus NP problem. His textbook "Introduction to the Theory of Computation" quickly become the standard for undergraduate theory around the world. Sipser started a very successful term as head of the mathematics department at MIT in 2004, leaving the post in 2014 to become Dean of Science.

### Organizers

- Lance Fortnow
- Sofya Raskhodnikova
- Leonard Schulman
- Ravi Sundaram

### Sponsors

- Clay Institute
- MIT Math
- Tom Leighton