Seminars

The Theoretical Computer Science and Discrete Mathematics Seminars will take place every Monday at 10:30 a.m. - 11:30 a.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:

Jan
20
2026

Computer Science/Discrete Mathematics Seminar II

All-Pairs Min-Cut vs. All-Pairs Shortest-Path
Amir Abboud
10:30am|Simonyi 101 and Remote Access

The All-Pairs Min-Cut problem (APMC) asks to compute the minimum cut (or equivalently, the maximum flow) between all pairs of nodes in a graph.1 The naive solution of making n^2 calls to a single-pair min-cut algorithm was surpassed in 1961 by a...

Jan
20
2026

Computer Science/Discrete Mathematics Seminar II

Improving Algorithmic Efficiency Using Cryptography
Or Zamir
11:30am|Simonyi 101 and Remote Access

Cryptographic primitives have been used for various non-cryptographic objectives, such as eliminating or reducing randomness and interaction. We show how to use cryptography to improve the time complexity of solving computational problems...

Feb
02
2026

Computer Science/Discrete Mathematics Seminar I

Disjoint Pairs in Set Systems and the Combinatorics of Low-Rank Matrices
Benjamin Sudakov
11:00am|Simonyi Hall 101 and Remote Access

In this talk, I will discuss the solution to several problems in two closely related settings: set families in 2^[n] with many disjoint pairs, and low-rank matrices with many zero entries.

Highlights include a resolution of an old question of Daykin...

More Events