Publications

Merav Parter, Seth Pettie and Asaf Petruschka
Connectivity Labeling and Routing with Multiple Vertex Failures
STOC 2024  [arXiv]

Greg Bodwin, Bernhard Haeupler and Merav Parter
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free
SODA 2024  [arXiv]

Merav Parter
Secure Computation Meets Distributed Universal Optimality
FOCS 2023

Shimon Kogan and Merav Parter
Towards Bypassing Lower Bounds for Graph Shortcuts
ESA 2023

Shimon Kogan and Merav Parter
New Additive Emulators
ICALP 2023

Orr Fischer and Merav Parter
Distributed CONGEST Algorithms against Mobile Adversaries
PODC 2023 [arXiv]

Yael Hitron, Merav Parter and Eylon Yogev
Secure Distributed Network Optimization Against Eavesdroppers
ITCS 2023

Shimon Kogan and Merav Parter
Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Cover
SODA 2023

Yael Hitron, Merav Parter and Eylon Yogev
Broadcast CONGEST Algorithms Against Eavesdroppers
DISC 2022

Merav Parter and Asaf Petruschka
Near-Optimal Distributed Computation of Small Vertex Cuts
DISC 2022 [arXiv]

Merav Parter and Asaf Petruschka
\~{O}ptimal Dual Vertex Failure Connectivity Labels 
DISC 2022 [arXiv]

Shimon Kogan and Merav Parter
Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets
FOCS 2022 [arXiv]

Shimon Kogan and Merav Parter
Beating Matrix Multiplication for $n^{1/3}$-Directed Shortcuts
ICALP 2022 [Full Version]

Merav Parter
Nearly Optimal Vertex Fault-Tolerant Spanners in Optimal Time:
Sequential, Distributed and Parallel
STOC 2022 [arXiv]

Shimon Kogan and Merav Parter
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the $\sqrt{n}$ Barrier
SODA 2022 [arXiv]
Best Paper Award at SODA'22

Yael Hitron and Merav Parter
Broadcast CONGEST Algorithms against Adversarial Edges
DISC 2021  [arXiv]
Best Student Paper Award at DISC'21

Yael Hitron and Merav Parter
General CONGEST Compilers against Adversarial Edges
DISC 2021  [PDF]
Best Student Paper Award at DISC'21

Greg Bodwin and Merav Parter
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
PODC 2021  [arXiv]
Best Paper Award at PODC'21

Michal Dory and Merav Parter
Fault-Tolerant Labeling and Compact Routing Schemes
PODC 2021  [arXiv]

Shimon Kogan and Merav Parter
Low-Congestion Shortcuts in Constant Diameter Graphs
PODC 2021  [arXiv]

Artur Czumaj, Peter Davies and Merav Parter
Improved Deterministic $(\Delta+1)$ Coloring in Low-Space MPC             
PODC 2021    Full Version 

Artur Czumaj, Peter Davies and Merav Parter
Component Stability in Low-Space Massively Parallel Computation
PODC 2021   [arXiv]           

Karthik C.S. and Merav Parter
Deterministic Replacement Path Covering
SODA 2021  [arXiv]

Yael Hitron, Cameron Musco and Merav Parter
Spiking Neural Networks Through the Lens of Streaming Algorithms
DISC 2020

Merav Parter
Distributed Planar Reachability in Nearly Optimal Time
DISC 2020

Merav Parter
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers
DISC 2020

Michal Dory and Merav Parter
Exponentially Faster Shortest Paths in the Congested Clique
PODC 2020  [arXiv]
Best Paper Award at PODC'20

Artur Czumaj, Peter Davies and Merav Parter
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
PODC 2020 [arXiv]

Julia Chuzhoy, Merav Parter and Zihan Tan
On Packing Low-Diameter Spanning Trees
ICALP 2020 [arXiv]

Greg Bodwin, Keerti Choudhary, Merav Parter and Noa Shahar
New Fault Tolerant Subset Preservers
ICALP 2020

Artur Czumaj, Peter Davies and Merav Parter
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
SPAA 2020 [arXiv]