Events and Activities

Explore current and upcoming events and activities happening at the Institute for Advanced Study.

Jun
01
2026

Computer Science/Discrete Mathematics Seminar I

Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR
Jarosław Błasiok
11:00am|Simonyi Hall 101 and Remote Access

In the noisy $k$-XOR problem, one is given $y \in \bF_2^\constraints$ and must distinguish between $y$ uniform and $y = A x + e$, where $A$ is the adjacency matrix of a $k$-left-regular bipartite graph with variables and constraints, $x\in \bF_2^...

Jun
02
2026

Computer Science/Discrete Mathematics Seminar II

Algebraic Expander Codes
Itzhak Tamo
10:30am|Simonyi 101 and Remote Access

By combining sparse graphs with local constraints, expander codes offer a powerful framework for achieving fast decoding algorithms while maintaining asymptotically good rate and minimum distance. However, the standard constraint-counting arguments...

Jun
08
2026

Computer Science/Discrete Mathematics Seminar I

Random Geometric Graphs
Aleksa Milojević
11:00am|Simonyi Classroom 114

The random geometric graph Geo_d(n,p) is a probability distribution over graphs, constructed by placing n points uniformly on a d-dimensional sphere and connecting two points whenever they are sufficiently close — where the proximity threshold is...