Derandomizing Local Distributed Algorithms under Bandwidth Restrictions

@article{CensorHillel2017DerandomizingLD,
  title={Derandomizing Local Distributed Algorithms under Bandwidth Restrictions},
  author={Keren Censor-Hillel and Merav Parter and Gregory Schwartzman},
  journal={ArXiv},
  year={2017},
  volume={abs/1608.01689}
}
  • Keren Censor-Hillel, Merav Parter, Gregory Schwartzman
  • Published 2017
  • Computer Science
  • ArXiv
  • This paper addresses the cornerstone family of \emph{local problems} in distributed computing, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions. Our main contribution is in providing tools for derandomizing solutions to local problems, when the $n$ nodes can only send $O(\log n)$-bit messages in each round of communication. We combine bounded independence, which we show to be sufficient for some algorithms, with the method of… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 31 CITATIONS, ESTIMATED 91% COVERAGE

    Distributed Symmetry-Breaking Algorithms for Congested Cliques

    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Distributed MIS via All-to-All Communication

    VIEW 1 EXCERPT
    CITES RESULTS

    Efficient Deterministic Distributed Coloring with Small Bandwidth

    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    (Delta+1) Coloring in the Congested Clique Model

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS

    FILTER CITATIONS BY YEAR

    2017
    2020

    CITATION STATISTICS

    • 2 Highly Influenced Citations

    • Averaged 9 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 64 REFERENCES