Home | Registration | Program | Directions | Flyer |
8:30am | Coffee & Tea |
9:00am | Complexity in an Era of Data-Driven Computing |
Lance Fortnow (Illinois Institute of Technology) | |
Abstract |
10:00am | The Minimum Circuit Size Problem through the Ages |
Eric Allender (Rutgers University) | |
Abstract |
11:00am | Pseudorandom Generators |
Oded Goldreich (Weizmann Institute) | |
Abstract |
12:00pm | Lunch break |
1:30pm | Connections between pseudorandomness and an area of CS that cannot be mentioned here |
Russell Impagliazzo (UC San Diego) | |
Abstract to come. |
2:30pm | Levin Complexity: Lower Bounds and Prime Numbers |
Igor Carboni Oliveira (University of Warwick) | |
Abstract to come. |
3:30pm | Coffee & Tea |
4:00pm | Power Set Axiom, Internal Classes, External Sets |
Leonid Levin (Boston University) | |
Abstract |
5:00pm | Thoughts on Kolmogorov’s and Levin’s works |
Alexei Semenov (Moscow State University) | |
Abstract to come. |
6:30pm | Banquet |
8:30am | Coffee & Tea |
9:00am | Universality in Communication |
Madhu Sudan (Harvard University) | |
Abstract |
10:00am | TBA |
Joseph Miller (University of Wisconsin) | |
Abstract to come. |
11:00am | TBA |
Jack Lutz (Iowa State University) | |
Abstract to come. |
12:00pm | Lunch break |
1:30pm | TBA |
Jason Teutsch (TrueBit) | |
Abstract to come. |
2:30pm | Software Science View on Quantum Circuit Algorithms |
Yuri Gurevich (University of Michigan) | |
Abstract |
3:30pm | Coffee & Tea |
4:00pm | Differential Geometry and Complexity of Robust Optimization of Smooth Functions |
Ramarathnam Venkatesan (Microsoft) | |
Abstract to come. |
5:00pm | TBA |
Gene Itkis (MIT Lincoln Laboratory) | |
Abstract to come. |