Jan. 15, 3:30pm, Wean 8220

Alexander Barvinok, University of Michigan

Computing partition functions in hard problems of combinatorial optimization

Alexander Barvinok, University of Michigan

Computing partition functions in hard problems of combinatorial optimization

Jan. 21 and Jan. 23, 3:30pm, Wean 8220 (Note 2-day lecture series on unusual days)

Nike Sun, MIT

The exact k-SAT threshold for large k

Nike Sun, MIT

The exact k-SAT threshold for large k

Feb. 5, 3:30pm, Wean 8220

Sergey Norine, McGill University

Densities of minor-closed families of graphs

Sergey Norine, McGill University

Densities of minor-closed families of graphs

Feb. 26, 3:30pm, Wean 8220

Milan Bradonjic, Bell Labs, Alcatel-Lucent

Asymptotic laws for coloring sparse random geometric graphs with constant number of colors

Milan Bradonjic, Bell Labs, Alcatel-Lucent

Asymptotic laws for coloring sparse random geometric graphs with constant number of colors

Sep. 25, 3:30pm, Wean 8220

Oleg Pikhurko, University of Warwick

Measurable equidecompositions via augmenting paths

Oleg Pikhurko, University of Warwick

Measurable equidecompositions via augmenting paths

Oct. 2, 3:30pm, Wean 8220

Jie Ma, Carnegie Mellon University

Relations between digraph colorings and cycle class

Jie Ma, Carnegie Mellon University

Relations between digraph colorings and cycle class

Oct. 9, 3:30pm, Wean 8220

Humberto Naves, Institute for Mathematics and its Applications, University of Minnesota

The threshold probability for long cycles

Humberto Naves, Institute for Mathematics and its Applications, University of Minnesota

The threshold probability for long cycles

Oct. 29, noon, Gates 6115 (Note unusual day, time and location)

Noga Alon, Tel Aviv University

The Complexity of Forming an Effective Government (Algorithmic Economics Seminar/Theory Lunch)

Noga Alon, Tel Aviv University

The Complexity of Forming an Effective Government (Algorithmic Economics Seminar/Theory Lunch)

Oct. 30, 3:30pm, Gates 8115 (Note unusual location)

Thomas Rothvoß, University of Washington

The matching polytope has exponential extension complexity

Thomas Rothvoß, University of Washington

The matching polytope has exponential extension complexity

Nov. 27, everywhere **except** Wean 8220

Turkey, Thanksgiving

Turkey, Thanksgiving

Dec. 4, 3:30pm, Wean 8220

Hao Huang, Institute for Mathematics and its Applications, University of Minnesota

Biclique decomposition of random graphs

Hao Huang, Institute for Mathematics and its Applications, University of Minnesota

Biclique decomposition of random graphs

If you **want to be a speaker** or have questions or suggestions
about the seminar, please contact
**the organizer**:
Boris Bukh ()

Subscribe to the ACO seminar mailing list