Invited Survey Talks (60 minutes)

• Nima Anari (Stanford University) - A survey on Log-Concave Polynomials and Counting Bases of a Matroid
• Vincent Cohen-Addad (Google Research) - A survey of recent advances on clustering in Euclidean and planar settings
• Ilias Diakonikolas (UW Madison) - A survey on Learning in High Dimensions with Asymmetric Label Noise
• Friedrich Eisenbrand (EPFL) - A survey on Structural approach to solving ILPs using proximity results and Graver bases
• Anupam Gupta (CMU) - A survey on chasing convex bodies
• Nisheeth K. Vishnoi (Yale) - A survey of recent advances in algorithmic fairness
  
  

Invited Regular Talks (30 minutes)

• Arkadev Chattopadhyay (Tata Institute of Fundamental Research Mumbai) - The Log-Approximate-Rank Conjecture is False (STOC2019). Co-authors: Nikhil Mande and Suhail Sherif
• Jugal Garg (University of Illinois at Urbana-Champaign) - A Strongly Polynomial Algorithm for Linear Exchange Markets (STOC2019). Co-authors: Laszlo A. Vegh
• Uri Zwick (Tel Aviv university) - Faster k-SAT algorithms using biased-PPSZ (STOC2019). Co-authors: Thomas Dueholm Hansen, Haim Kaplan and Or Zamir
• Sebastian Brandt (ETH Zurich) - Lower bounds for maximal matchings and maximal independent sets (FOCS2019). Co-authors: Alkida Balliu, Juho Hirvonen, Dennis Olivetti, Mikael Rabie and Jukka Suomela
• Jason Li (Carnegie Mellon University) - Faster Minimum k-cut of a Simple Graph (FOCS2019)
• Shay Solomon (Tel Aviv University) - Truly Optimal Euclidean Spanners (FOCS2019). Co-authors: Hung Le
• Pravesh Kothari (CMU) - Approximation Schemes for a Buyer with Independent Items via Symmetries (FOCS2019). Co-authors: Divyarthi Mohan, Ariel Schvartzman, Sahil Singla and S. Matthew Weinberg
• Valerie King (University of Victoria) - Random k-out subgraph leaves only O(n/k) inter-component edges (FOCS2019). Co-authors: Jacob Holm, Mikkel Thorup , Or Zamir and Uri Zwick
• Deeparnab Chakrabarty (Dartmouth College) - Faster Matroid Intersection (FOCS2019). Co-authors: Yin Tat Lee, Aaron Sidford, Sahil Singla and Sam Chiu-wai Wong
• David Wajc (CMU) - Tight Bounds for Online Edge Coloring (FOCS2019). Co-authors: Ilan Reuven Cohen and Binghui Peng
• Sepehr Assadi (Rutgers University) - Sublinear Algorithms for (Delta + 1) Vertex Coloring (SODA2019). Co-authors: Yu Chen and Sanjeev Khanna
• Karl Bringmann (MPI) - SETH-Based Lower Bounds for Subset Sum and Bicriteria Path (SODA2019). Co-authors: Amir Abboud, Danny Hermelin and Dvir Shabtay
• Santosh S. Vempala (Georgia Tech) - The Communication Complexity of Optimization (SODA2020). Co-authors: Ruosong Wang and David P. Woodruff
• Sayan Bhattacharya (University of Warwick) - Coarse-Grained Complexity for Dynamic Algorithms (SODA2020). Co-authors: Danupon Nanongkai and Thatchaphol Saranurak
• Thatchaphol Saranurak (Toyota Technological Institute at Chicago) - Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration (PODC2019). Co-authors: Yi-Jun Chang
• Avery Miller (University of Manitoba) - Constant-Length Labeling Schemes for Deterministic Radio Broadcast (SPAA2019). Co-authors: Faith Ellen, Barun Gorain and Andrej Pelc
• Vasilis Syrgkanis (Microsoft Research, New England) - Statistical Learning with a Nuisance Component (COLT2019). Co-authors: Dylan Foster
• Sivakanth Gopi (Microsoft Research, Redmond) - Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (ITCS2019). Co-authors: Zeev Dvir, , Yuzhou Gu and Avi Wigderson
• Eylon Yogev (Boston U. and Tel Aviv U.) - The Adversarial Robustness of Sampling (PODS2020). Co-authors: Omri Ben-Eliezer