19 citations · 110 across the 50 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free
Greg Bodwin, Bernhard Haeupler, Merav Parter
We study a new and stronger notion of fault-tolerant graph structures whose size bounds depend on the degree of the failing edge set, rather than the total number of faults. For a…
cs.DS2023
Connectivity Labeling and Routing with Multiple Vertex Failures
Merav Parter, Asaf Petruschka, Seth Pettie
We present succinct labeling schemes for answering connectivity queries in graphs subject to a specified number of vertex failures. An -vertex/edge fault tolerant (-V/EFT) co…
cs.DS2023★ 1 cited
Distributed CONGEST Algorithms against Mobile Adversaries
Orr Fischer, Merav Parter
In their seminal PODC 1991 paper, Ostrovsky and Yung introduced the study of distributed computation in the presence of mobile adversaries which can dynamically appear throughout t…