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...

Full description

Bibliographic Details

Published in:	2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) pp. 662 - 673
Main Authors:	Ghaffari, Mohsen, Harris, David G., Kuhn, Fabian
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2018
Subjects:	Approximation algorithms Color Complexity theory Computational modeling Computer science derandomization Distributed algorithms hypergraph matching LOCAL Lovász Local Lemma
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!