Past Events
2012-2013
May
02
Ankur Moitra , IAS
A polynomial time algorithm for lossy population recovery
Fine Hall 224 /
-
Apr
18
Esther Ezra , NYU
On Relative Approximations in Geometric Hypergraphs
Fine Hall 224 /
-
Apr
11
Vaidy Sivaraman , Binghamton University
Transversal signed-graphic matroids
Fine Hall 224 /
-
Mar
28
Tony Huynh , Simon Fraser
Even-cycle decompositions of graphs with no odd-K_4-minor
Fine Hall 224 /
-
Mar
14
Tom Hales , University of Pittsburgh Mellon
Informal and formal verification of nonlinear inequalities with applications to discrete geometry
Fine Hall 224 /
-
Mar
07
Amanda Redlich , Rutgers University
Graph constructions, graph decompositions, and random graphs
Fine Hall 224 /
-
Feb
21
Alex Scott, Oxford University
Discrepancy of graphs and hypergraphs
Fine Hall 224 /
-
Feb
14
Emmanuel Abbe , Princeton University
Polar codes and randomness extraction for structured sources
Fine Hall 224 /
-
Dec
06
David Pritchard, Princeton University
Cover-decomposition and polychromatic numbers
Fine Hall 224 /
-
Nov
29
Josh Zahli , UCLA
A Szemeredi-Trotter theorem in R^4
Fine Hall 224 /
-
Nov
15
Bruce Reed , McGill University
How long does it take to catch a drunk miscreant?
Fine Hall 224 /
-
Nov
08
Endre Szemeredi , Rutgers University
On the Erdos-Sos conjecture
Fine Hall 224 /
-
Oct
25
Manor Mendel , Open U Israel and IAS
Expanders with respect to random regular graphs
Fine Hall 224 /
-
Oct
18
Shiva Kintali, Princeton University
Directed width parameters: algorithms and structural properties
Fine Hall 224 /
-
Oct
11
Hao Huang , IAS
Extremal problems in Eulerian digraphs
Fine Hall 224 /
-
Oct
04
Sanjeev Arora, Princeton University
What have we learned about graph partitioning?
Fine Hall 224 /
-
Sep
27
Wesley Pegden , NYU
Apollonian structure in the abelian sandpile
Fine Hall 224 /
-
Sep
20
Peter Nelson, Victoria University of Wellington
The Erdos-Stone Theorem for finite geometries
Fine Hall 224 /
-