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:

Feb
24
2026

Computer Science/Discrete Mathematics Seminar II

List Decoding: Algebraic and Combinatorial
10:30am|Simonyi 101 and Remote Access

In the theory of error-correcting codes, list decoding allows a decoder to output a list of candidates when attempting to remove noise from a corrupted input. The constructions and algorithms for such list decodable codes has had numerous...

Mar
02
2026

Computer Science/Discrete Mathematics Seminar I

Color-avoiding Paths
Yuval Wigderson
11:00am|Simonyi Hall 101 and Remote Access

The very first result ever proved about tournaments is due to Rédei, who nearly 100 years ago proved that every tournament contains a Hamiltonian directed path. Since then, questions and results about directed paths in tournaments have become a...

Mar
03
2026

Computer Science/Discrete Mathematics Seminar II

VC Dimensions and Regularity
Yuval Wigderson
10:30am|Simonyi 101 and Remote Access

The regularity lemma says that every discrete object can be partitioned into a small number of random-like subobjects. But how small is small? And can we make small smaller if we assume that our given object is simple? And what does it mean for a...