–
Coffee and Check-in
–
Property Testing for Graphs
Artur Czumaj (University of Warwick)
–
Break
–
Testing Boolean Functions
Erik Waingarten (University of Pennsylvania)
–
Lunch (on your own)
–
Counting Subgraphs in Sublinear Time
C. Seshadhri (UC Santa Cruz)
–
Break
–
Sampling Big Ideas in Sublinear Algorithms
Edith Cohen (Tel Aviv University and Google)
–
Reception
–
Coffee and Check-in
–
An Introduction to Distributed, Massively Parallel, and Local Computation Algorithms
Mohsen Ghaffari (Massachusetts Institute of Technology)
–
Break
–
Graph Algorithms in the MPC Model
Slobodan Mitrovic (UC Davis)
–
Lunch (on your own)
–
Conditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds
Artur Czumaj (University of Warwick)
–
Break
–
Graph Coloring Through the Sublinear Lens
Sepehr Assadi (University of Waterloo and Rutgers University)
–
Coffee and Check-in
–
An Overview on Data Streams Algorithms
Andrew McGregor (University of Massachusetts Amherst)
–
Break
–
Coresets and Their Applications to Design Sublinear Algorithms
Sepideh Mahabadi (Microsoft Research)
–
Lunch (on your own)
–
New Advances on Multi-Pass Graph Streaming Lower Bounds
Sepehr Assadi (University of Waterloo and Rutgers University)
–
Break
–
Adversarially Robust Streaming Algorithms
Omri Ben-Eliezer (Simons Institute)
–
Coffee and Check-in
–
Distribution Testing: Hypothesis Testing from Very Little (or Very Private) Data
Clément Canonne (University of Sydney)
–
Break
–
Testing Assumptions of Learning Algorithms
Arsen Vasilyan (MIT)
–
Lunch (on your own)
–
Sketching and Randomized Linear Algebra
David Woodruff (Carnegie Mellon University)
–
Break
–
Sublinear Time Algorithms for Estimating Edit Distance
Barna Saha (UC San Diego)