Seminars

The Theoretical Computer Science and Discrete Mathematics Seminars will take place every Monday at 11:00 a.m. - 12:00 p.m. and every Tuesday at 10:30 a.m. - 12:30 p.m. at the Institute for Advanced Study. The lectures will be held in S-101, the seminar room in Simonyi Hall, unless stated otherwise.

If you are interested in attending future seminars and are not already on our mailing list from previous years, please send an e-mail to Andrea Lass and ask to be added.

alass email

 

Upcoming Seminar Titles Include:

May
04
2026

Computer Science/Discrete Mathematics Seminar I

Analog Coding, List Decoding, Bandwidth, and Mean Dimension
Elon Lindenstrauss
10:30am|Simonyi Hall 101 and Remote Access

Suppose we have some system X, that evolves over time. We want to communicate the status of a point in X at all times using a bandwidth limited channel. How big a bandwidth is needed to achieve this? And what is the connection to Shannon entropy and...

May
12
2026

Computer Science/Discrete Mathematics Seminar II

Informal Talk on the Quantum Soundness of the Low (individual) Degree Test: Part II
Michael Chapman
10:30am|Simonyi 101 and Remote Access

A common tool in the construction of probabilistically checkable proofs is low degree encodings. Babai, Fortnow and Lund proved the local testability of the individual low degree code, and used it to provide a multi-prover interactive proof (MIP)...

May
18
2026

Computer Science/Discrete Mathematics Seminar I

Shuffling is Universal: Statistical Additive Randomized Encodings for All Functions
Nir Bitansky
11:00am|West Lecture Hall and Remote Access

The shuffle model is a widely used abstraction for non-interactive anonymous communication. It allows $n$ parties holding private inputs $x_1,\dots,x_n$ to simultaneously send messages to an evaluator, so that the messages are received in a random...

More Events