(cache)Program | Conference Template

Conference Program (tentative)

Tuesday, July 9

6:00-7:00pm

Reception

Wednesday, July 10

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

2:30pm	Levin Complexity and Pseudodeterministic Constructions of Primes
	Igor Carboni Oliveira (Warwick University)
	Abstract

3:30pm

Coffee & Tea

4:00pm	Set Theory in the Foundation of Math; 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

6:30pm

Banquet

Thursday, July 11

8:30am

Coffee & Tea

9:00am	Universality in Communication
	Madhu Sudan (Harvard University)
	Abstract

10:00am	The Continuous Degrees and Neutral Measures
	Joseph Miller (University of Wisconsin)
	Abstract

11:00am	Differential Geometry and Complexity of Robust Optimization of Smooth Functions
	Ramarathnam Venkatesan (Microsoft)
	Abstract

12:00pm

Lunch break

1:30pm	From Transparent Proof to Transparent Compute
	Jason Teutsch (TrueBit)
	Abstract

2:30pm	Rethinking Security: Access Control Without Built-in Central Points of Failure
	Gene Itkis (MIT Lincoln Laboratory)
	Abstract

3:30pm

Coffee & Tea

4:00pm	Logic and generative AI
	Yuri Gurevich (University of Michigan)
	Abstract

5:00pm	Use AI to Assist In-Depth Reading of Computational Complexity Theory Papers
	Jie Wang (University of Massachusetts, Lowell)
	Abstract