A simpler conditional-expectations derandomization yields (L,f)-RPCs with Õ(f L^{f+o(1)}) covering value and Õ(f^{5/2} L^{o(1)}) query time; a new randomized construction matches an improved lower bound of Õ((L/f)^f L^{o(1)}) when f = o(log L).
Broadcast CONGEST Algorithms against Adversarial Edges
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Simpler and Improved Replacement Path Coverings
A simpler conditional-expectations derandomization yields (L,f)-RPCs with Õ(f L^{f+o(1)}) covering value and Õ(f^{5/2} L^{o(1)}) query time; a new randomized construction matches an improved lower bound of Õ((L/f)^f L^{o(1)}) when f = o(log L).