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. 1210.5774
  4. Cited By
Fast Routing Table Construction Using Small Messages
v1v2 (latest)

Fast Routing Table Construction Using Small Messages

21 October 2012
Christoph Lenzen
B. Patt-Shamir
ArXiv (abs)PDFHTML

Papers citing "Fast Routing Table Construction Using Small Messages"

16 / 16 papers shown
Title
Distributed Distance Approximation
Distributed Distance Approximation
Bertie Ancona
K. Censor-Hillel
M. Dalirrooyfard
Yuval Efron
Virginia Vassilevska Williams
69
13
0
10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model
Computing Shortest Paths and Diameter in the Hybrid Network Model
Fabian Kuhn
P. Schneider
85
30
0
15 Jun 2020
Shortest Paths in a Hybrid Network Model
Shortest Paths in a Hybrid Network Model
John E. Augustine
Kristian Hinnenthal
Fabian Kuhn
Christian Scheideler
P. Schneider
44
31
0
04 Sep 2019
Fast Approximate Shortest Paths in the Congested Clique
Fast Approximate Shortest Paths in the Congested Clique
K. Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
56
54
0
14 Mar 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
A. Bernstein
K. Kirchberg
62
53
0
08 Nov 2018
Parameterized Distributed Algorithms
Parameterized Distributed Algorithms
Ran Ben-Basat
Ken-ichi Kawarabayashi
Gregory Schwartzman
46
14
0
13 Jul 2018
Improved Distributed Algorithms for Exact Shortest Paths
Improved Distributed Algorithms for Exact Shortest Paths
M. Ghaffari
Jason Li
60
60
0
25 Dec 2017
A Faster Distributed Single-Source Shortest Paths Algorithm
A Faster Distributed Single-Source Shortest Paths Algorithm
Sebastian Krinninger
Danupon Nanongkai
58
66
0
03 Nov 2017
Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde
  O(n^{5/4})$ Rounds
Distributed Exact Weighted All-Pairs Shortest Paths in O~(n5/4)\tilde O(n^{5/4})O~(n5/4) Rounds
Chien-Chung Huang
Danupon Nanongkai
Thatchaphol Saranurak
51
45
0
13 Aug 2017
Near-Linear Lower Bounds for Distributed Distance Computations, Even in
  Sparse Networks
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
Amir Abboud
K. Censor-Hillel
Seri Khoury
43
75
0
17 May 2016
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
101
112
0
27 Apr 2015
Algebraic Methods in the Congested Clique
Algebraic Methods in the Congested Clique
K. Censor-Hillel
P. Kaski
Janne H. Korhonen
Christoph Lenzen
A. Paz
Jukka Suomela
54
160
0
17 Mar 2015
Fast Partial Distance Estimation and Applications
Fast Partial Distance Estimation and Applications
Christoph Lenzen
B. Patt-Shamir
58
62
0
26 Dec 2014
Near-Optimal Distributed Approximation of Minimum-Weight Connected
  Dominating Set
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
M. Ghaffari
55
19
0
30 Apr 2014
Distributed Connectivity Decomposition
Distributed Connectivity Decomposition
K. Censor-Hillel
M. Ghaffari
Fabian Kuhn
98
58
0
21 Nov 2013
Can Quantum Communication Speed Up Distributed Computation?
Can Quantum Communication Speed Up Distributed Computation?
Michael Elkin
H. Klauck
Danupon Nanongkai
Gopal Pandurangan
116
50
0
22 Jul 2012
1