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. 1704.05739
  4. Cited By
How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
v1v2 (latest)

How Long It Takes for an Ordinary Node with an Ordinary ID to Output?

19 April 2017
Laurent Feuilloley
ArXiv (abs)PDFHTML

Papers citing "How Long It Takes for an Ordinary Node with an Ordinary ID to Output?"

8 / 8 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
50
34
0
12 Jun 2020
LCL problems on grids
LCL problems on grids
S. Brandt
J. Hirvonen
Janne H. Korhonen
Tuomo Lempiäinen
P. Östergård
Christopher Purcell
Joel Rybicki
Jukka Suomela
P. Uznański
LRM
55
59
0
17 Feb 2017
Survey of Distributed Decision
Survey of Distributed Decision
Laurent Feuilloley
Pierre Fraigniaud
78
47
0
14 Jun 2016
An Exponential Separation Between Randomized and Deterministic
  Complexity in the LOCAL Model
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
Yi-Jun Chang
T. Kopelowitz
Seth Pettie
94
166
0
26 Feb 2016
Toward more localized local algorithms: removing assumptions concerning
  global knowledge
Toward more localized local algorithms: removing assumptions concerning global knowledge
Amos Korman
Jean-Sébastien Sereni
L. Viennot
40
59
0
10 Dec 2015
A Lower Bound for the Distributed Lovász Local Lemma
A Lower Bound for the Distributed Lovász Local Lemma
S. Brandt
Orr Fischer
J. Hirvonen
Barbara Keller
Tuomo Lempiäinen
Joel Rybicki
Jukka Suomela
Jara Uitto
52
133
0
03 Nov 2015
Brief Announcement : Average Complexity for the LOCAL Model
Brief Announcement : Average Complexity for the LOCAL Model
Laurent Feuilloley
44
1
0
19 May 2015
Limits of local algorithms over sparse random graphs
Limits of local algorithms over sparse random graphs
D. Gamarnik
Madhu Sudan
59
165
0
05 Apr 2013
1