On Derandomizing Local Distributed Algorithms

The gap between the known randomized and deterministic local distributed algorithms underlies arguably the most fundamental and central open question in distributed graph algorithms. In this paper, we combine the method of conditional expectation with network decompositions to obtain a generic and c...

Celý popis

Podrobná bibliografia

Vydané v:	2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) s. 662 - 673
Hlavní autori:	Ghaffari, Mohsen, Harris, David G., Kuhn, Fabian
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2018
Predmet:	Approximation algorithms Color Complexity theory Computational modeling Computer science derandomization Distributed algorithms hypergraph matching LOCAL Lovász Local Lemma
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!