ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.07861
  4. Cited By
Symmetry Breaking in the Congest Model: Time- and Message-Efficient
  Algorithms for Ruling Sets

Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets

22 May 2017
Shreyas Pai
Gopal Pandurangan
Sriram V. Pemmaraju
Talal Riaz
Peter Robinson
ArXivPDFHTML

Papers citing "Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets"

3 / 3 papers shown
Title
Sleeping is Efficient: MIS in $O(1)$-rounds Node-averaged Awake
  Complexity
Sleeping is Efficient: MIS in O(1)O(1)O(1)-rounds Node-averaged Awake Complexity
Soumyottam Chatterjee
R. Gmyr
Gopal Pandurangan
43
33
0
12 Jun 2020
A Deterministic Almost-Tight Distributed Algorithm for Approximating
  Single-Source Shortest Paths
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
73
112
0
27 Apr 2015
The Locality of Distributed Symmetry Breaking
The Locality of Distributed Symmetry Breaking
Leonid Barenboim
Michael Elkin
Seth Pettie
Johannes Schneider
81
296
0
09 Feb 2012
1