Weizmann-Warwick 2023 Workshop

February 26 - March 1, 2023

Weizmann-Warwick Workshop 2023 on Combinatorial and Algorithmic Primitives for Modern Networks is taking place at the Department of Computer Science and Applied Mathematics , Weizmann Institute, February 26 - March 1, 2023.

This event is by invitation only.

The workshop is supported by the Weizmann-UK Making Connections Grant Combinatorial and Algorithmic Primitives for Modern Networks, awarded to Sayan Bhattacharya and Artur Czumaj (both at the University of Warwick), and Robert Krauthgamer and Merav Parter (both from the Weizmann Institute).

Day 1:	Sunday, February 26, Weizmann
11:00 - 12:30	Quick introductions (Goldenberg Library, Ziskind)
12:30 - 14:00	Lunch Break (Goldenberg Library, Ziskind)
14:00 - 15:00	Tutorial Talk (Ziskind 155) Sayan Bhattacharya: Recent Advances in Dynamic Matching
15:00 - 15:15	Break
15:15 - 16:30	Session 1: Dynamic Graph Algorithms (Ziskind 155)
15:15 - 15:35	Peter Kiss: Dynamic (1+ε)-Approximate Matching Size in Truly Sublinear Update Time
15:45 - 16:05	Anish Mukherjee: Dynamic Path Reporting Algorithms
16:10 - 16:20	Martin Costa: Dynamic algorithm for k-median
16:25 - 17:00	Open problems for dynamic graph algorithms (Merav and Sayan)

Day 2:	Monday, February 27, Weizmann (Goldenberg Library, Ziskind) + Jerusalem
10:00 - 11:55	Session 2: Project Presentation
	Martin Costa: Online edge coloring
	Sam Coy: Massively Parallel Matching
	Shay Sapir: Pseudo deterministic streaming of L0
	Anish Mukherjee, Artur Czumaj: Streaming MPC
	Orr Fischer, Merav Parter: Byzantine MPC
12:30	Travel to Jerusalem

Day 3:	Tuesday February 28, Jerusalem (Harmony Hotel)
10:00 - 11:00	Tutorial Talk Peter Davies: LOCAL and Low-Space MPC: A Bridge Between Distributed and Parallel Computing
12:30 - 14:30	Lunch Break
14:00 - 15:40	Session 3: Streaming, MPC & Distributed Algorithms
14:00 - 14:20	Sam Coy: Deterministic connectivity on low-space MPC
14:20 - 14:40	Gopinath Mishra: k-center for low-space MPC
14:40 - 15:00	Shay Sapir: Lower Bounds for Pseudo-Deterministic Counting in a Stream
15:00 - 15:20	Asaf Petrushka: Distributed Detection of Small Vertex Cuts
15:20 - 15:40	Orr Fischer: Distributed Resilience against Mobile Adversaries
19:00	Dinner

Day 4:	Wednesday, March 1, Weizmann (Ziskind 155)
10:00 - 11:00	Tutorial Talk Amir Abboud: APMF < APSP? Breaking the Cubic Barrier for Gomory-Hu Tree
12:30 - 14:00	Lunch Break
14:00 - 15:00	Session 4: Fine-Grained Complexity
14:00 - 14:20	Seri Khoury: Hardness of approximation in P via short cycle removal
14:20 - 14:40	Nathan Wallheimer: Worst-case to Expander-case Reductions