ACO Seminar, 2011-2012

Jan. 26, 3:30pm, Wean 8220
Paul Horn, Harvard
Isomorphic subgraphs in uniform hypergraphs

Feb. 2, 3:30pm, Wean 8220
Richard Peng, CMU
Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming

Monday Feb. 13, 3:30pm, Wean 8220
Michael Krivelevich, Tel Aviv University
The phase transition in random graphs - a simple proof

Feb. 16, 3:30pm, Wean 8220
Jacob Fox, MIT
Two extensions of Ramsey's theorem

Feb. 23, 3:30pm, Wean 8220
Ron Holzman, Technion
Wild edge colorings of the hypercube and impartial peer ranking

Mar. 1, 3:30pm, Wean 8220
Jian Ding, Stanford
Scaling window for mean-field percolation of averages

Mar. 8, 3:30pm, Wean 8220
Igor Balla, CMU
Extremal Results for Union-Closed Families

Friday Mar. 23, 4:30pm, Wean 7500 (Note unusual day, place, and time)
Jeff Kahn, Rutgers
Thresholds and expectation thresholds

Mar. 29, 3:30pm, Wean 8220
Cameron Freer, MIT
Model-theoretic constructions of Limit Structures

Apr. 12, 3:30pm, Wean 8220
Tobias Mueller, Centrum Wiskunde & Informatica (CWI), Amsterdam
Line arrangements and geometric representations of graphs

Apr. 26, 3:30pm, Wean 8220
Eric Price, MIT
Algorithms and Lower Bounds for Sparse Recovery

May 3, 3:30pm, Wean 8220
Asaf Ferber, Tel Aviv University
Winning fast in Maker-Breaker games played on sparse random boards

Fall 2011

Sep. 1, 3:30pm, Wean 8220
Simi Haber, CMU
Extending the first order language by natural graph properties

Sep. 8, 3:30pm, Wean 8220
Oleg Pikhurko, CMU
Irrationality of the Turan Density

Sep. 15, 3:30pm, Wean 8220
Hoi Nguyen, University of Pennsylvania
Non-singularity of random matrices, a structural approach

Sep. 22, 3:30pm, Wean 8220
James Cummings, CMU
Exact computation of a Ramsey multiplicity constant

Sep. 29, 3:30pm, Wean 8220
Wes Pegden, New York University
The fractal nature of the Abelian Sandpile

Oct. 6, 3:30pm, Wean 8220
Amit Weinstein, Tel Aviv University
Local Correction of Bolean Functions

Oct. 13, 3:30pm, Wean 8220
Ohad Feldheim, Tel Aviv University
Rigidity of 3-colorings of the d-dimensional discrete torus

Oct. 20, 4:00pm, Gates 4401: Rashid Auditorium (Note unusual place and time)
School of Computer Science Distinguished Lecture Series
Ravi Kannan, Microsoft Research, India
Vectors, sampling, and massive data

Tuesday Oct. 25, 3:30pm, Wean 8220 (Note unusual day)
Boris Bukh, Cambridge
Space crossing numbers

Oct. 27, 3:30pm, Wean 8220
Boris Pittel, Ohio State
On the satisfiability threshold for k-XORSAT

Nov. 3, 3:30pm, Wean 8220
Patrick Bennett, CMU
A natural barrier in random greedy hypergraph matching

Nov. 10, 4:30pm, Tepper 322 (Note unusual place and time)
Joint CMU/Pitt Economics Seminar
Gabriel Carroll, MIT
A Quantitative Approach to Incentives: Application to Voting Rules

Nov. 17, 3:30pm, Wean 8220
Andrzej Dudek, Western Michigan University
On rainbow Hamilton cycles in uniform hypergraphs

Dec. 1, 3:30pm, Wean 8220
David Gamarnik, MIT
Interpolation method and scaling limits in sparse random graphs

Dec. 8, 3:30pm, Wean 8220
Alan Frieze, CMU
On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three

If you want to be a speaker or have questions or suggestions about the seminar, please contact the organizer: Po-Shen Loh ( ploh@cmu.edu )

The ACO Seminar (2011-2012)

Spring 2012

Fall 2011

Past Schedule: