Feb. 2, 3:30pm, Wean 8220

Richard Peng, CMU

Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming

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

Michael Krivelevich, Tel Aviv University

The phase transition in random graphs - a simple proof

Feb. 23, 3:30pm, Wean 8220

Ron Holzman, Technion

Wild edge colorings of the hypercube and impartial peer ranking

Ron Holzman, Technion

Wild edge colorings of the hypercube and impartial peer ranking

Friday Mar. 23, 4:30pm, Wean 7500 (Note unusual day, place, and time)

Jeff Kahn, Rutgers

Thresholds and expectation thresholds

Jeff Kahn, Rutgers

Thresholds and expectation thresholds

Apr. 12, 3:30pm, Wean 8220

Tobias Mueller, Centrum Wiskunde & Informatica (CWI), Amsterdam

Line arrangements and geometric representations of graphs

Tobias Mueller, Centrum Wiskunde & Informatica (CWI), Amsterdam

Line arrangements and geometric representations of graphs

May 3, 3:30pm, Wean 8220

Asaf Ferber, Tel Aviv University

Winning fast in Maker-Breaker games played on sparse random boards

Asaf Ferber, Tel Aviv University

Winning fast in Maker-Breaker games played on sparse random boards

Sep. 1, 3:30pm, Wean 8220

Simi Haber, CMU

Extending the first order language by natural graph properties

Simi Haber, CMU

Extending the first order language by natural graph properties

Sep. 15, 3:30pm, Wean 8220

Hoi Nguyen, University of Pennsylvania

Non-singularity of random matrices, a structural approach

Hoi Nguyen, University of Pennsylvania

Non-singularity of random matrices, a structural approach

Sep. 29, 3:30pm, Wean 8220

Wes Pegden, New York University

The fractal nature of the Abelian Sandpile

Wes Pegden, New York University

The fractal nature of the Abelian Sandpile

Oct. 13, 3:30pm, Wean 8220

Ohad Feldheim, Tel Aviv University

Rigidity of 3-colorings of the d-dimensional discrete torus

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

School of Computer Science Distinguished Lecture Series

Ravi Kannan, Microsoft Research, India

Vectors, sampling, and massive data

Nov. 3, 3:30pm, Wean 8220

Patrick Bennett, CMU

A natural barrier in random greedy hypergraph matching

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

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

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

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

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
)

Subscribe to the ACO seminar mailing list