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. 1601.04306
  4. Cited By
Feedback from Nature: Simple Randomised Distributed Algorithms for
  Maximal Independent Set Selection and Greedy Colouring

Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring

17 January 2016
P. Jeavons
A. Scott
Lei Xu
ArXiv (abs)PDFHTML

Papers citing "Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring"

7 / 7 papers shown
Title
Feedback from nature: an optimal distributed algorithm for maximal
  independent set selection
Feedback from nature: an optimal distributed algorithm for maximal independent set selection
A. Scott
P. Jeavons
Lei Xu
62
42
0
01 Nov 2012
Beeping a Maximal Independent Set
Beeping a Maximal Independent Set
Y. Afek
N. Alon
Z. Bar-Joseph
Alejandro Cornejo
Bernhard Haeupler
Fabian Kuhn
103
116
0
01 Jun 2012
The Locality of Distributed Symmetry Breaking
The Locality of Distributed Symmetry Breaking
Leonid Barenboim
Michael Elkin
Seth Pettie
Johannes Schneider
83
298
0
09 Feb 2012
Stone Age Distributed Computing
Stone Age Distributed Computing
Y. Emek
Jasmin Smula
Roger Wattenhofer
108
88
0
06 Feb 2012
Deploying Wireless Networks with Beeps
Deploying Wireless Networks with Beeps
Alejandro Cornejo
Fabian Kuhn
101
128
0
14 May 2010
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Leonid Barenboim
Michael Elkin
103
114
0
08 Mar 2010
Distributed (Delta + 1)-coloring in linear (in Delta) time
Distributed (Delta + 1)-coloring in linear (in Delta) time
Leonid Barenboim
Michael Elkin
81
95
0
07 Dec 2008
1