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. 1505.05697
  4. Cited By
A Fast Network-Decomposition Algorithm and its Applications to
  Constant-Time Distributed Computation
v1v2 (latest)

A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation

21 May 2015
Leonid Barenboim
Michael Elkin
C. Gavoille
ArXiv (abs)PDFHTML

Papers citing "A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation"

2 / 2 papers shown
Title
On the Locality of Some NP-Complete Problems
On the Locality of Some NP-Complete Problems
Leonid Barenboim
LRM
63
24
0
30 Apr 2012
The Locality of Distributed Symmetry Breaking
The Locality of Distributed Symmetry Breaking
Leonid Barenboim
Michael Elkin
Seth Pettie
Johannes Schneider
85
298
0
09 Feb 2012
1