On Derandomizing Local Distributed Algorithms

@article{Ghaffari2018OnDL,
  title={On Derandomizing Local Distributed Algorithms},
  author={M. Ghaffari and D. G. Harris and F. Kuhn},
  journal={2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2018},
  pages={662-673}
}
  • M. Ghaffari, D. G. Harris, F. Kuhn
  • Published 2018
  • Computer Science, Mathematics
  • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 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 clean recipe for derandomizing LOCAL algorithms. This leads to significant improvements on a number of problems, in cases resolving known open problems. Two main results are: - An improved… CONTINUE READING
    On the Complexity of Distributed Splitting Problems
    • 5
    • PDF
    Deterministic coloring algorithms in the LOCAL model
    • 1
    • PDF
    Polylogarithmic-time deterministic network decomposition and distributed derandomization
    • 30
    • PDF
    Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma
    • 4
    • Highly Influenced
    Local approximation of the Maximum Cut in regular graphs
    Distributed Spanner Approximation
    • 13
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 63 REFERENCES
    An Improved Distributed Algorithm for Maximal Independent Set
    • 138
    • PDF
    On the complexity of local distributed graph problems
    • 72
    • PDF
    Distributed algorithms for the Lovász local lemma and graph coloring
    • 60
    • Highly Influential
    • PDF
    A lower bound for the distributed Lovász local lemma
    • 71
    • Highly Influential
    • PDF
    Distributed Degree Splitting, Edge Coloring, and Orientations
    • 59
    • PDF
    Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs
    • 17
    • PDF
    An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
    • 75
    • Highly Influential
    • PDF
    Distributed Graph Coloring: Fundamentals and Recent Developments
    • 144
    • Highly Influential
    • PDF
    Sublogarithmic Distributed Algorithms for Lovász Local lemma, and the Complexity Hierarchy
    • 37
    • PDF
    An efficient distributed algorithm for constructing small dominating sets
    • 114
    • PDF