–
Coffee and Check-in
–
Talk by
Artur Czumaj (University of Warwick)
–
Break
–
Testing Boolean Functions
Erik Waingarten (University of Pennsylvania)
–
Lunch (on your own)
–
Counting Subgraphs in Sublinear Time
Seshadhri Comandur (UC Santa Cruz)
–
Break
–
Talk by
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
–
Talk by
Slobodan Mitrovic (UC Davis)
–
Lunch (on your own)
–
Talk by
Artur Czumaj (University of Warwick)
–
Break
–
Talk by
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
–
Talk by
Sepideh Mahabadi (Microsoft Research)
–
Lunch (on your own)
–
Talk by
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)
Register

Registration is required to attend this workshop. Space may be limited, and you are advised to register early. The link to the registration form will appear on this page approximately 10 weeks before the workshop.

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