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. 1011.5470
  4. Cited By
Local Computation: Lower and Upper Bounds

Local Computation: Lower and Upper Bounds

24 November 2010
Fabian Kuhn
Thomas Moscibroda
Roger Wattenhofer
ArXivPDFHTML

Papers citing "Local Computation: Lower and Upper Bounds"

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
41
32
0
12 Jun 2020
Distributed Domination on Graph Classes of Bounded Expansion
Distributed Domination on Graph Classes of Bounded Expansion
S. A. Amiri
P. D. Mendez
Roman Rabinovich
S. Siebertz
GNN
20
22
0
09 Feb 2017
Distributed Verification and Hardness of Distributed Approximation
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma
S. Holzer
Liah Kor
Amos Korman
Danupon Nanongkai
Gopal Pandurangan
David Peleg
Roger Wattenhofer
67
344
0
12 Nov 2010
1