The ACO Seminar (2020–2021)

September 10, 3:30pm, https://cmu.zoom.us/j/98951280265
Boris Bukh, Carnegie Mellon University
Words and their subsequences

September 17, 3:30pm, https://cmu.zoom.us/j/98951280265
Alan Frieze, Carnegie Mellon University
Expected values in combinatorial optimization

September 24, 3:30pm, https://cmu.zoom.us/j/98951280265
Sai Sandeep Pallerla, Carnegie Mellon University
An Algorithmic Study of the Hypergraph Turan Problem

October 1, 3:30pm, https://cmu.zoom.us/j/98951280265
Ting-Wei Chao, Carnegie Mellon University
Point sets in $\mathbb{R}^d$ without convex $k$-holes

October 8, 3:30pm, https://cmu.zoom.us/j/98951280265
Tomasz Tkocz, Carnegie Mellon University
Khinchin inequalities with sharp constants

October 15, 3:30pm, https://cmu.zoom.us/j/98951280265
Kaave Hosseini, Carnegie Mellon University
Signrank vs Discrepancy

October 22, 3:30pm, https://cmu.zoom.us/j/98951280265
Matt Superdock, Carnegie Mellon University
The necklace splitting problem and robot motion planning

October 29, 3:30pm, https://cmu.zoom.us/j/98951280265
Nóra Frankl, Carnegie Mellon University and London School of Economics
VC-saturated set systems

November 5, 3:30pm, https://cmu.zoom.us/j/98951280265
Florian Frick, Carnegie Mellon University
The topological Tverberg problem beyond prime powers

November 19, 3:30pm, https://cmu.zoom.us/j/98951280265
Santosh Vempala, Georgia Tech
Solving Sparse Linear Systems Faster than Matrix Multiplication

December 3, 3:30pm, https://cmu.zoom.us/j/98951280265
Andrew Newman, CMU
Randomized construction of complexes with large diameter

December 10, 3:30pm, https://cmu.zoom.us/j/98951280265
Jeffrey Zhang, CMU
On Local Minima in Polynomial Optimization