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"

4 / 4 papers shown
Title
Fast Deterministic Constructions of Linear-Size Spanners and Skeletons
Fast Deterministic Constructions of Linear-Size Spanners and Skeletons
Michael Elkin
Shaked Matar
17
1
0
25 Jul 2019
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time
Michael Elkin
Shaked Matar
44
21
0
03 Mar 2019
Distributed Dominating Set Approximations beyond Planar Graphs
Distributed Dominating Set Approximations beyond Planar Graphs
S. A. Amiri
Stefan Schmid
S. Siebertz
53
27
0
25 May 2017
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
K. Censor-Hillel
M. Parter
Gregory Schwartzman
87
75
0
04 Aug 2016
1