The conference takes place online Aug 31 to Sept 2, with the following schedule (according to local time in Zurich, i.e., the Central European Summer Time).

Day 1 (Mon, Aug 31)

12:00-12:30 Shay Solomon (Tel Aviv University) - Truly Optimal Euclidean Spanners (FOCS2019). [video]

12:30-13:00 Karl Bringmann (MPI) - SETH-Based Lower Bounds for Subset Sum and Bicriteria Path (SODA2019). [video]

13:00-13:30 Sayan Bhattacharya (University of Warwick) - Coarse-Grained Complexity for Dynamic Algorithms (SODA2020). [video]

14:30-15:30 Vincent Cohen-Addad (Google Research) - A survey of recent advances on clustering in Euclidean and planar settings. [video]

15:30-16:00 Sepehr Assadi (Rutgers) - Sublinear Algorithms for (Delta + 1) Vertex Coloring (SODA2019). [video]

16:00-16:30 Deeparnab Chakrabarty (Dartmouth College) - Faster Matroid Intersection (FOCS2019). [video]

17:30-18:00 Jugal Garg (University of Illinois at Urbana-Champaign) - A Strongly Polynomial Algorithm for Linear Exchange Markets (STOC2019). [video]

18:00-18:30 David Wajc (CMU) - Tight Bounds for Online Edge Coloring (FOCS2019). [video]

18:30-19:30 Nima Anari (Stanford University) - A survey on Log-Concave Polynomials and Counting Bases of a Matroid. [video]

Day 2 (Tues, Sep 1)

09:45-10:32 Session I of short contributed talks

10:43-11:26 Session II of short contributed talks

12:00-12:30 Arkadev Chattopadhyay (Tata Institute of Fundamental Research Mumbai) - The Log-Approximate-Rank Conjecture is False (STOC2019). [video]

12:30-13:30 Friedrich Eisenbrand (EPFL) - A survey on Structural approach to solving ILPs using proximity results and Graver bases [video]

14:30-15:00 Vasilis Syrgkanis (Microsoft Research, New England) - Statistical Learning with a Nuisance Component (COLT2019). [video]

15:00-15:30 Jason Li (Carnegie Mellon University) - Faster Minimum k-cut of a Simple Graph (FOCS2019) [video]

15:30-16:30 Business meeting

17:30-18:30 Anupam Gupta (CMU) - A survey on chasing convex bodies. [video]

18:30-19:00 Thatchaphol Saranurak (TTI Chicago) - Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration (PODC2019). [video]

19:00-19:30 Valerie King (University of Victoria) - Random k-out subgraph leaves only O(n/k) inter-component edges (FOCS2019). [video]

Day 3 (Wed, Sep 2)

09:45-10:32 Session III of short contributed talks

10:43-11:26 Session IV of short contributed talks

12:00-12:30 Uri Zwick (Tel Aviv university) - Faster k-SAT algorithms using biased-PPSZ (STOC2019). [video]

12:30-13:00 Eylon Yogev (Boston U. and Tel Aviv U.) - The Adversarial Robustness of Sampling (PODS2020). [video]

13:00-13:30 Sebastian Brandt (ETH Zurich) - Lower bounds for maximal matchings and maximal independent sets (FOCS2019). [video]

14:30-15:00 Pravesh Kothari (CMU) - Approximation Schemes for a Buyer with Independent Items via Symmetries (FOCS2019). [video]

15:00-15:30 Santosh S. Vempala (Georgia Tech) - The Communication Complexity of Optimization (SODA2020). [video]

15:30-16:30 Nisheeth K. Vishnoi (Yale) - A survey of recent advances in algorithmic fairness. [video]

17:30-18:30 Ilias Diakonikolas (UW Madison) - A survey on Learning in High Dimensions with Asymmetric Label Noise [video]

18:30-19:00 Avery Miller (University of Manitoba) - Constant-Length Labeling Schemes for Deterministic Radio Broadcast (SPAA2019). [video]

19:00-19:30 Sivakanth Gopi (Microsoft Research, Redmond) - Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (ITCS2019). [video]