skip to main content
review-article

Distributed Symmetry: Breaking from a Local Point of View

Published: 01 December 2015 Publication History
First page of PDF

References

[1]
L. Barenboim. Efficient network utilization in locality-sensitive distributed algorithms. PhD Thesis. 2013.
[2]
L. Barenboim. On the Locality of Some NP-complete Problems. In Proc. of the 39th International Colloquium on Automata, Languages, and Programming, part II, pages 403--415, 2012.
[3]
L. Barenboim. Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks. In Proc. of the 34th ACM Symp. on Principles of Distributed Computing, pages 345--354, 2015.
[4]
L. Barenboim, and M. Elkin. Sublogarithmic Distributed MIS Algorithm for Sparse Graphs using Nash-Williams Decomposition. In Proc. of the 27th ACM Symp. on Principles of Distributed Computing, pages 25--34, 2008.
[5]
L. Barenboim, and M. Elkin. Deterministic Distributed Vertex Coloring in Polylogarithmic Time. In Proc. 29th ACM Symp. on Principles of Distributed Computing, pages 410--419, 2010.
[6]
L. Barenboim, and M. Elkin. Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence. In Proc. of the 30th ACM Symp. on Principles of Distributed Computing, pages 129--138, 2011.
[7]
L. Barenboim, and M. Elkin. Combinatorial Algorithms for Distributed Graph Coloring. In Proc. of the 25th International Symp. on Distributed Computing, pages 66--81, 2011.
[8]
L. Barenboim, M. Elkin, and C. Gavoille. A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation. In Proc. of the 22nd International Colloquium on Structural Information and Communication Complexity, 2015.
[9]
L. Barenboim, M. Elkin, and F. Kuhn. Distributed (Δ+1)-Coloring in Linear (in Δ) Time. SIAM Journal on Computing, 43(1): 72--95, 2014.
[10]
F. Kuhn, and R. Wattenhofer. On the complexity of distributed graph coloring. In Proc. of the 25th ACM Symp. on Principles of Distributed Computing, pages 7--15, 2006.
[11]
N. Linial. Distributive graph algorithms: Global solutions from local data In Proc. of the 28th Annual Symp. on Foundation of Computer Science, pages 331--335, 1987.
  1. Distributed Symmetry: Breaking from a Local Point of View

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM SIGACT News
      ACM SIGACT News  Volume 46, Issue 4
      December 2015
      103 pages
      ISSN:0163-5700
      DOI:10.1145/2852040
      Issue’s Table of Contents
      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 01 December 2015
      Published in SIGACT Volume 46, Issue 4

      Check for updates

      Qualifiers

      • Review-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 98
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 16 Feb 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media