Schedule

Program of Workshop on Foundations of Distributed and Parallel Graph Algorithms (Venice 2026)

09:00 - 09:30 Coffee
09:30 - 09:45 Welcome
09:45 - 10:45
- Algorithmic Meta-Theorems for Distributed Computing
10:45 - 11:30 Coffee break
11:30 - 12:00
- The Semi-Robust Communication Complexity of Maximum Matching
12:00 - 12:30
- Distributed Algorithms for Local Potential Problems
12:30 - 14:30 Lunch at
- Address:
15:00 - 15:30
- Byzantine Agreement with Predictions
15:30 - 16:00
- Sparsification Framework for Directed Densest Subgraph in MPC, Semi-Streaming, and Sublinear-Time Model
16:00 - 16:30 Coffee break
16:30 - 18:00 Open Problem Session + Research discussions
18:00 - 19:00 Welcome reception

09:00 - 09:30 Coffee
09:30 - 10:30
- Survey of the Distributed Lov谩sz Local Lemma
10:30 - 11:00 Coffee break
11:00 - 11:30
- LCLs with and without knowledge of n
11:30 - 12:00
- Self-Stabilizing Algorithms in the Uniform Port Model
12:00 - 12:30
- On Distributed Lower Bound Techniques and a Gap in the Distributed Complexity Landscape
13:00 - 14:30 Lunch at
- Address:
15:00 - 15:30
- Towards Optimal-pass Semi-streaming Matchings and Beyond
15:30 - 16:00
- Distributed Minimum Weight Cycle Approximation
16:00 - 16:30 Coffee break
16:30 - 18:00 Research discussions

09:00 - 09:30 Coffee
09:30 - 10:30
- Breaking Barriers and Closing Gaps for MIS and MM by Understanding Vertex Survival Probability
10:30 - 11:00 Coffee break
11:00 - 11:30
- What Can We Learn from Neuronal Connectivity Alone?
11:30 - 12:00
- Neighborhood Similarity: A New Application and Technique
12:00 - 12:30
- Zero-Knowledge Distributed Certification
13:00 - 15:00 Lunch at
- Address:
15:00 - 19:00 Research discussions

The workshop is by invitation only

May 18 - 21, 2026

, Calle Giustinian, 2893, 30124 Venezia, Italy