Skip to main content
Search
Utility navigation
Calendar
Contact
Login
MAKE A GIFT
Main navigation
Home
Programs & Events
Research Programs
Workshops & Symposia
Public Lectures
Research Pods
Internal Program Activities
Algorithms, Society, and the Law
People
Scientific Leadership
Staff
Current Long-Term Visitors
Research Fellows
Postdoctoral Researchers
Scientific Advisory Board
Governance Board
Industry Advisory Council
Affiliated Faculty
Science Communicators in Residence
Law and Society Fellows
Participate
Apply to Participate
Plan Your Visit
Accessibility
Location & Directions
Postdoctoral Research Fellowships
Law and Society Fellowships
Science Communicator in Residence Program
Circles
Breakthroughs Workshops and Goldwasser Exploratory Workshops
Support
Annual Fund
All Funders
Institutional Partnerships
News & Videos
News
Videos
About
Image
Sublinear Algorithms Reunion
Program
Sublinear Algorithms
Location
Calvin Lab auditorium
Date
Monday, June 30
–
Thursday, July 3, 2025
Back to calendar
Breadcrumb
Home
Workshop & Symposia
Schedule
Secondary tabs
The Workshop
Schedule
All talks listed in Pacific Time. Schedule subject to change.
Monday, June 30, 2025
9
–
9:30 a.m.
Coffee and Check-In
9:30
–
10 a.m.
Part 1: Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
David Woodruff (Carnegie Mellon University)
10
–
10:30 a.m.
Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
Samson Zhou (Texas A&M University)
10:30
–
11 a.m.
Break
11 a.m.
–
12 p.m.
Student Talks
Yiqiao Bao (University of Pennsylvania)
,
Amir Azarmehr (Northeastern)
,
Janani Sudaresan (University of Waterloo)
12
–
2 p.m.
Lunch
2
–
2:30 p.m.
Distribution learning with advice (Remote Talk)
Arnab Bhattacharyya (University of Warwick)
2:30
–
3 p.m.
Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
Pan Peng (University of Science and Technology of China)
3
–
3:30 p.m.
Break
3:30
–
4 p.m.
Talk by
Shivam Nadimpalli (MIT)
4:30
–
5:30 p.m.
Reception
Tuesday, July 1, 2025
9
–
9:30 a.m.
Coffee and Check-In
9:30
–
10 a.m.
Vizing's Theorem in Near-Linear Time
Soheil Behnezhad (Northeastern University)
10
–
10:30 a.m.
Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
Erik Waingarten (University of Pennsylvania)
10:30
–
11 a.m.
Break
11 a.m.
–
12 p.m.
Student Talks
Shyamal Patel (Columbia)
,
Guy Blanc (Stanford)
,
Alma Ghafari (Northeastern)
12
–
2 p.m.
Lunch (on your own)
2
–
2:30 p.m.
Leveraging Predictions for Efficient Hypothesis Testing of Discrete Distributions
Maryam Aliakbarpour (Rice University)
2:30
–
3 p.m.
Talk by
Artur Czumaj (University of Warwick)
3
–
3:30 p.m.
Break
3:30
–
4 p.m.
Talk by
Shweta Jain (University of Utah)
4
–
4:30 p.m.
Learning-Augmented Streaming Algorithms for Approximating Max-Cut
Ali Vakilian (TTIC)
4:30
–
4:50 p.m.
Learning-Augmented Streaming Algorithms for Correlation Clustering
Yinhao Dong (University of Science and Technology of China)
Wednesday, July 2, 2025
9
–
9:30 a.m.
Coffee and Check-In
9:30
–
10 a.m.
Relative-error property testing
Rocco Servedio (Columbia University)
10
–
10:30 a.m.
Talk by
Arsen Vasilyan (UT Austin)
10:30
–
11 a.m.
Break
11 a.m.
–
12 p.m.
Student Talks
Justin Chen (Massachusetts Institute of Technology)
,
Tianqi Yang (Columbia University)
,
Lily Chung (MIT)
12
–
2 p.m.
Lunch (on your own)
2
–
2:30 p.m.
Techniques for Adversarially Robust Locality Sensitive Hashing
Krzysztof Onak (Boston University)
2:30
–
3 p.m.
Testing Grainedness of Discrete Distributions, and applications to Uniformity Testing in the Huge Object model
Clément Canonne (University of Sydney)
3
–
3:30 p.m.
Break
3:30
–
4 p.m.
Local Computation Algorithm for Set Cover via Retroactive Updates
Slobodan Mitrovic (UC Davis)
4
–
4:30 p.m.
Sensitivity Lower Bounds for Approximation Algorithms
Yuichi Yoshida (National Institute of Informatics)
4:30
–
4:50 p.m.
Student Talk: Srikkanth Ramachandran
Srikkanth Ramachandran (UC Davis)
Thursday, July 3, 2025
9
–
9:30 a.m.
Coffee and Check-In
9:30
–
10 a.m.
Approximately counting and sampling Hamiltonian motifs in sublinear-time (Remote Talk)
Talya Eden (MIT)
10
–
10:30 a.m.
Graph-Based Algorithms for Diverse Similarity Search
Sepideh Mahabadi (Microsoft Research)
10:30
–
11 a.m.
Break
11
–
11:30 a.m.
Talk by
Vipul Arora (UC Berkeley)
11:30
–
11:50 a.m.
Student Talk: Uri Meir
Uri Meir (Tel Aviv University)
11:50 a.m.
–
12:30 p.m.
Trivia
Share this page
Copy URL of this page
link to homepage
Close
Main navigation
Home
Programs & Events
Research Programs
Workshops & Symposia
Public Lectures
Research Pods
Internal Program Activities
Algorithms, Society, and the Law
People
Scientific Leadership
Staff
Current Long-Term Visitors
Research Fellows
Postdoctoral Researchers
Scientific Advisory Board
Governance Board
Industry Advisory Council
Affiliated Faculty
Science Communicators in Residence
Law and Society Fellows
Participate
Apply to Participate
Plan Your Visit
Accessibility
Location & Directions
Postdoctoral Research Fellowships
Law and Society Fellowships
Science Communicator in Residence Program
Circles
Breakthroughs Workshops and Goldwasser Exploratory Workshops
Support
Annual Fund
All Funders
Institutional Partnerships
News & Videos
News
Videos
About
Utility navigation
Calendar
Contact
Login
MAKE A GIFT
link to homepage
Close
Search