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. 1903.00872
  4. Cited By
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time

Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time

3 March 2019
Michael Elkin
Shaked Matar
ArXiv (abs)PDFHTML

Papers citing "Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time"

3 / 3 papers shown
Title
Deterministic Distributed Ruling Sets of Line Graphs
Deterministic Distributed Ruling Sets of Line Graphs
Fabian Kuhn
Yannic Maus
Simon Weidner
35
26
0
18 May 2018
A Fast Network-Decomposition Algorithm and its Applications to
  Constant-Time Distributed Computation
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation
Leonid Barenboim
Michael Elkin
C. Gavoille
48
9
0
21 May 2015
A Deterministic Almost-Tight Distributed Algorithm for Approximating
  Single-Source Shortest Paths
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
75
112
0
27 Apr 2015
1