19 citations · 110 across the 50 of their papers we have counts for
5 papers · 2 filters
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
Artur Czumaj, Peter Davies, Merav Parter
We settle the complexity of the -coloring and -list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems r…
Deterministic Replacement Path Covering
Karthik C. S., Merav Parter
In this article, we provide a unified and simplified approach to derandomize central results in the area of fault-tolerant graph algorithms. Given a graph , a vertex pair $(s,t)…
On Packing Low-Diameter Spanning Trees
Julia Chuzhoy, Merav Parter, Zihan Tan
Edge connectivity of a graph is one of the most fundamental graph-theoretic concepts. The celebrated tree packing theorem of Tutte and Nash-Williams from 1961 states that every …
Broadcast CONGEST Algorithms against Adversarial Edges
Yael Hitron, Merav Parter
We consider the corner-stone broadcast task with an adaptive adversary that controls a fixed number of edges in the input communication graph. In this model, the adversary sees…
Exponentially Faster Shortest Paths in the Congested Clique
Michal Dory, Merav Parter
We present improved deterministic algorithms for approximating shortest paths in the Congested Clique model of distributed computing. We obtain -round algorithms…