Past Events
2011-2012
May
03
Maria Chudnovsky, Columbia University
Edge-coloring 8-regular planar graphs
Fine Hall 224 /
-
Apr
26
Avi Wigderson, IAS
Points, lines, and local correction of codes
Fine Hall 224 /
-
Apr
19
Raghu Meka, IAS
Constructive discrepancy minimization by walking on the edges
Fine Hall 224 /
-
Apr
12
Xiaoyun Lu, US Census Bureau
A theorem on plane graphs
Fine Hall 224 /
-
Apr
05
Jeff Kahn, Rutgers
Mantel's Theorem for Random Graphs
Fine Hall 224 /
-
Mar
29
Benjamin Matschke, IAS
On the Diameter of Polytopes
Fine Hall 224 /
-
Mar
15
Ben Clark, U. Wellington
Tangles, Trees, and Flowers
Fine Hall 224 /
-
Mar
08
Ankur Moitra, IAS
Pareto Optimal Solutions for Smoothed Analysts
Fine Hall 224 /
-
Mar
01
Claudiu Raicu, Princeton University
Homology of Clique Complexes and an Application to Algebraic Geometry
Fine Hall 224 /
-
Feb
16
Bill Cook, Georgia Tech and Princeton
The Traveling Salesman Problem: A Blueprint for Optimization
Fine Hall 224 /
-
Feb
09
Krzysztof Choromanski, Columbia
New Classes of Tournaments Satisfying the Erdos-Hajnal Conjecture
Fine Hall 224 /
-
Dec
15
Zeev Dvir, Princeton University
Subspace evasive sets
Fine Hall 224 /
-
Dec
08
Balazs Szegedy, University of Toronto
On Sidorenko's Conjecture
Fine Hall 224 /
-
Dec
01
Noga Alon, Tel Aviv University
The chromatic number of random Cayley graphs
Fine Hall 224 /
-
Nov
17
Shubhangi Saraf, MIT
Noisy interpolation of sparse polynomials, and applications
Fine Hall 224 /
-
Nov
10
Jacob Fox, MIT
Graph regularity and removal lemmas
Fine Hall 224 /
-
Oct
27
Stefan van Zwam, Princeton University
Beyond Total Unimodularity
Fine Hall 224 /
-
Oct
20
Laszlo Lovasz, Eotvos Lorand University, Budapest and IAS, Princeton
Subgraph densities in signed graphs and local extremal graph problems
Fine Hall 224 /
-
Oct
13
Shachar Lovett, IAS
Existence of small families of t-wise independent permutations and t-designs via local limit theorems
Fine Hall 224 /
-
Oct
06
Eli Berger, Haifa University
On the strong coloring of graphs with bounded degree
Fine Hall 224 /
-
Sep
29
Benny Sudakov, UCLA
The size of a hypergraph and its matching number
Fine Hall 224 /
-
Sep
22
Ron Aharoni, Technion, Haifa
Erdos-Ko-Rado-like theorems for rainbow matchings
Fine Hall 224 /
-
Sep
15
Matthias Mnich, International Computer Science Institute, Berkeley
Domination when the stars are out
Fine Hall 314 /
-