Jan. 21, 3:30pm, Wean 8220

Alexander Razborov, University of Chicago

Complexity of Algebraic and Semi-Algebraic Proofs

Alexander Razborov, University of Chicago

Complexity of Algebraic and Semi-Algebraic Proofs

Fri Jan. 22, 1:30pm, Gates 6115 (three-hour long) (Note unusual day, time, location, and duration)

Laszlo Babai, University of Chicago

Graph isomorphism in quasipolynomial time (Joint ACO/CS Theory seminar)

Laszlo Babai, University of Chicago

Graph isomorphism in quasipolynomial time (Joint ACO/CS Theory seminar)

Jan. 28, 3:30pm, Wean 8220

Mokshay Madiman, University of Delaware

On the tendency to convexity of Minkowski sums

Mokshay Madiman, University of Delaware

On the tendency to convexity of Minkowski sums

Feb. 4, 3:30pm, Wean 8220

Charilaos Efthymiou, Georgia Tech

Reconstruction thresholds for the random colourings of*G*(*n*,*m*)

Charilaos Efthymiou, Georgia Tech

Reconstruction thresholds for the random colourings of

Feb. 11, 3:30pm, Wean 8220

Christopher Cox, Carnegie Mellon University

Ramsey numbers for partially-ordered sets

Christopher Cox, Carnegie Mellon University

Ramsey numbers for partially-ordered sets

Mar. 17, 3:30pm, Wean 8220

Wolfgang Gatterbauer, Carnegie Mellon University

Oblivious Bounds on the Probability of Boolean Functions

Wolfgang Gatterbauer, Carnegie Mellon University

Oblivious Bounds on the Probability of Boolean Functions

Mar. 24, 3:30pm, Wean 8220

Kevin Milans, West Virginia University

Monotone paths in dense edge-ordered graphs

Kevin Milans, West Virginia University

Monotone paths in dense edge-ordered graphs

Apr. 21, 3:30pm, Wean 8220

Andrew Suk, University of Illinois at Chicago

On hypergraphs arising in geometry

Andrew Suk, University of Illinois at Chicago

On hypergraphs arising in geometry

May. 5, 3:30pm, Wean 8220

Tobias Johnson, University of Southern California

Size biased couplings and the spectral gap for random regular graphs

Tobias Johnson, University of Southern California

Size biased couplings and the spectral gap for random regular graphs

Oct. 29, 3:30pm, Wean 8220

Swastik Kopparty, Rutgers University

A local central limit theorem for triangles in a random graph

Swastik Kopparty, Rutgers University

A local central limit theorem for triangles in a random graph

Nov. 5, 3:30pm, Wean 8220

Caroline Terry, UIC

Discrete metric spaces: global structure, enumeration, and 0-1 laws

Caroline Terry, UIC

Discrete metric spaces: global structure, enumeration, and 0-1 laws

Nov. 19, 3:30pm, Wean 8220

Hamed Hatami, McGill University

A characterization of functions with vanishing averages over products of disjoint sets

Hamed Hatami, McGill University

A characterization of functions with vanishing averages over products of disjoint sets

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

Turkey, Thanksgiving

Turkey, Thanksgiving

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