Registration is needed. For more information and registration – see website.
For more than 40 years, Professor Johan Håstad has been a leading researcher in computational complexity theory. This mini-symposium will celebrate and explore his profound impact on a number of different areas ranging from circuit complexity and cryptography to approximation algorithms and pseudorandomness.
Talks by invited speakers; collaborators, friends, and others influenced by Johan’s work, including:
- Avi Wigderson (Institute for Advanced Study)
- Shafi Goldwasser (MIT)
- Venkatesan Guruswami (UC Berkeley)
- Prahladh Harsha (TIFR Mumbai)
- Ryan O’Donnell (Carnegie Mellon University)
- Pavel Pudlák (Czech Academy of Sciences)
- Madhu Sudan (Harvard University)
The conference is co-sponsored by Digital Futures.
