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
Location & Directions
Postdoctoral Research Fellowships
Law and Society Fellowships
Science Communicator in Residence Program
Circles
Breakthroughs Workshops and Goldwasser Exploratory Workshops
Support
Annual Fund
Funders
Industrial Partnerships
News & Videos
News
Videos
About
Image
Dynamic Graphs and Algorithm Design
Program
Data Structures and Optimization for Fast Algorithms
Location
Calvin Lab Auditorium
Date
Monday, Sept. 18
–
Friday, Sept. 22, 2023
Back to calendar
Breadcrumb
Home
Workshop & Symposia
Schedule
Secondary tabs
The Workshop
Schedule
Videos
All talks are listed in Pacific time. *Schedule subject to change*
Monday, Sept. 18, 2023
9
–
9:25 a.m.
Coffee and Check-in
9:25
–
9:30 a.m.
Opening Remarks
9:30
–
10:30 a.m.
Lightning Talks
10:30
–
11:15 a.m.
Approximating Edit Distance in the Fully Dynamic Model
Barna Saha (UC San Diego)
11:15
–
11:45 a.m.
Break
11:45 a.m.
–
12:30 p.m.
Recent Advances in Diversity Maximization in the Offline and Composable Coreset Models
Sepideh Mahabadi (Microsoft Research)
12:30
–
2 p.m.
Lunch
2:15
–
3 p.m.
Optimizing Dynamic-Graph Data Structures on Multicores with the Locality-First Strategy
Helen Xu
3
–
4 p.m.
Parallelism in Dynamic Graph Algorithms
Guy Blelloch (Carnegie Mellon University)
4
–
5 p.m.
Reception
Tuesday, Sept. 19, 2023
9
–
9:30 a.m.
Coffee and Check-in
9:30
–
10:30 a.m.
Recent Progress on Sublinear Time Algorithms for Maximum Matching: Upper Bounds
Soheil Behnezhad (Northeastern University)
10:30
–
11:15 a.m.
A Blackbox Reduction for Adaptive Adversaries using Differential Privacy
Thatchaphol Saranurak (University of Michigan)
11:15
–
11:45 a.m.
Break
11:45 a.m.
–
12:30 p.m.
Dynamic Algorithms for 𝑘-center on Graphs
Sebastian Forster (University of Salzburg)
12:30
–
2 p.m.
Lunch
2
–
2:45 p.m.
Parallel Batch-Dynamic Graph Representations
Laxman Dhulipala (University of Maryland)
2:45
–
3:15 p.m.
Break
3:15
–
4 p.m.
Dynamic Matching: Rounding & Sparsification (And New Tools)
David Wajc (Technion -- Israel Institute of Technology)
4
–
5 p.m.
Discussion Time
Wednesday, Sept. 20, 2023
9
–
9:30 a.m.
Coffee and Check-in
9:30
–
10:30 a.m.
Decremental Shortest Paths against an Adaptive Adversary
Aaron Bernstein (Rutgers University)
10:30
–
11:15 a.m.
Practical Dynamic Graph Algorithms: Data Structures and Connections Between Models
Quanquan Liu (Northwestern University)
11:15
–
11:45 a.m.
Break
11:45 a.m.
–
12:30 p.m.
Online List Labeling: Breaking the log^2 n Barrier
Nicole Wein (University of Michigan)
12:30
–
2 p.m.
Lunch
2
–
2:45 p.m.
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
Sayan Bhattacharya (University of Warwick)
2:45
–
3:15 p.m.
Break
3:15
–
4 p.m.
Dynamic PageRank: Additive Error and Batch Recomputation
Jakub Lacki (Google Research)
4
–
5 p.m.
Discussion Time
Thursday, Sept. 21, 2023
9
–
9:30 a.m.
Coffee and Check-in
9:30
–
10:30 a.m.
Dynamic Graphs on the GPU
John Owens (UC Davis)
10:30
–
11:15 a.m.
On Engineering Dynamic Graph Algorithms
Kathrin Hanauer (University of Vienna)
11:15
–
11:45 a.m.
Break
11:45 a.m.
–
12:30 p.m.
On Dynamic Graph Approximations: The case of j-Trees
Gramoz Goranci (University of Vienna)
12:30
–
2 p.m.
Lunch
2
–
2:45 p.m.
Minimum Isolating Cuts: A New Tool for Solving Minimum Cut Problems
Jason Li (Simons Institute, UC Berkeley)
2:45
–
3:15 p.m.
Break
3:15
–
4 p.m.
Faster High Accuracy Multi-Commodity Flows via Graph Techniques
Jan van der Brand (KTH Royal Institute of Technology)
4
–
5 p.m.
Discussion Time
Friday, Sept. 22, 2023
9
–
9:30 a.m.
Coffee and Check-in
9:30
–
10:15 a.m.
Recent Progress on Sublinear Time Algorithms for Maximum Matching: Lower Bounds
Soheil Behnezhad (Northeastern University)
10:15
–
11 a.m.
Parallel Batch-Dynamic Graph Algorithms
Julian Shun (MIT)
11
–
11:45 a.m.
Accelerating the Multiplicative-Weights Framework for Graph Linear Programs
Omri Weinstein (Princeton University)
11:45 a.m.
–
12 p.m.
Workshop Concludes
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
Location & Directions
Postdoctoral Research Fellowships
Law and Society Fellowships
Science Communicator in Residence Program
Circles
Breakthroughs Workshops and Goldwasser Exploratory Workshops
Support
Annual Fund
Funders
Industrial Partnerships
News & Videos
News
Videos
About
Utility navigation
Calendar
Contact
Login
MAKE A GIFT
link to homepage
Close
Search