–
Coffee and Check-In
–
Maximum Matching in $O(\log \log n)$ Passes in Dynamic Streams
Janani Sundaresan (University of Waterloo)
–
Improved streaming algorithms for Max-DICUT via local snapshots
Santhoshini Velusamy (Toyota Technological Institute at Chicago)
–
Discussions
–
Break
–
Online Algorithms for Spectral Hypergraph Sparsification
Yuichi Yoshida (National Institute of Informatics)
–
Lunch (on your own)
–
Almost-Optimal Sublinear Additive Spanners
Zihan Tan (Rutgers University)
–
New algorithms for directed spanner problems and generalizations
Elena Grigorescu (Purdue)
–
Discussions
–
Reception
–
Coffee and Check-In
–
Dynamic Matching and (Ordered) Ruzsa-Szemerédi Graphs: Towards Constructive Matching Sparsifiers
Soheil Behnezhad (Northeastern University), Alma Ghafari (Northeastern University)
–
Discussions
–
Break
–
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
Sepehr Assadi (University of Waterloo and Rutgers University)
–
Discussions
–
Lunch (on your own)
–
Sublinear algorithms for correlation clustering
Slobodan Mitrovic (UC Davis)
–
Fast Streaming Euclidean Clustering with Constant Space
Samson Zhou (Texas A&M University)
–
Discussions
–
Break
–
Stochastic Minimum Vertex Cover with Few Queries: a 3/2-approximation
Mahsa Derakhshan (UC Berkeley)
–
On (1 + ε)-Approximate (Vertex) Cut Sparsifiers
Yu Chen (EPFL)
–
Coffee and Check-In
–
Sparsification: Graphs, CSPs and Codes
Madhu Sudan (Harvard University)
–
Cut Sparsification and Succinct Representation of Submodular Hypergraphs
Robert Krauthgamer (Weizmann Institute of Science)
–
Discussions
–
Break
–
Linear Sketching Hypergraph Sparsifiers
Aaron Putterman (Harvard University)
–
Lunch (on your own)
–
Small Space Differentially Private Graph Algorithms in the Continual Release Model
Quanquan Liu (Simons Institute)
–
Approximating Maximum Matching Requires Almost Quadratic Time
Mohammad Roghani (Stanford)
–
Discussions
–
Break
–
Planar partition oracles (for bounded degree graphs) in poly(1/\eps) time
Akash Kumar (IIT Bombay)
–
The approximate structure of triangle-free graphs
Yuval Wigderson (ETH Zurich)
–
Coffee and Check-In
–
Sparsification for communication-efficient distributed symmetry-breaking
Yannic Maus (TU Graz)
–
Parallel Algorithms for Local Problems in Sparse Graphs
Jara Uitto (Aalto University)
–
Discussions
–
Break
–
Maximal Matching in Bounded-deletion Streams
Christian Konrad (University of Bristol, UK)
–
Discussions
–
Lunch (on your own)
–
A Quasi-Monte Carlo Algorithm for Smooth Kernel Evaluation
Erik Waingarten (University of Pennsylvania)
–
Recent Progress on Euclidean Spanners
Hung Le (University of Massachusetts Amherst)
–
Discussions
–
Break
–
Open Problems Session
–
Coffee and Check-In
–
Representing Distances in Directed Graphs via a Collection of DAGs
Nicole Wein (University of Michigan)
–
Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier
Jane Lange (Massachusetts Institute of Technology)
–
Discussions
–
Break
–
Sparsifying Set Systems for Coverage Problems
Andrew McGregor (University of Massachusetts Amherst)
–
Graph Connectivity Using Star Contraction
Sagnik Mukhopadhyay (University of Sheffield)
Register

Registration is required for in-person attendance, access to the livestream, and early access to the recording. Space may be limited, and you are advised to register early. 

For additional information please visit: https://simons.berkeley.edu/participating-workshop.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

Register Now