Approximate Distance Oracles (2001)

by Mikkel Thorup , Uri Zwick
Citations:213 - 9 self

Documents Related by Co-Citation

111 Compact Routing with Minimum Stretch – Lenore Cowen
196 Compact routing schemes – Mikkel Thorup, Uri Zwick
99 Distance Labeling in Graphs – Cyril Gavoille, David Peleg, Stéphane, Pérennes, Ran Raz - 2000
302 Distributed computing: a locality-sensitive approach – David Peleg - 2000
75 Routing with Polynomial Communication-Space Tradeoff – Baruch Awerbuch, David Peleg - 1993
63 Space-Efficiency for Routing Schemes of Stretch Factor Three – Cyril Gavoille, Marc Gengler - 1997
86 Routing in Trees – Pierre Fraigniaud, Cyril Gavoille - 2001
69 Improved routing strategies with succinct tables – B Awerbuch, A B Noy, N Linial, D Peleg - 1990
61 Compact Routing Schemes With Low Stretch Factor – Tamar Eilam, Tamar Eilam, Cyril Gavoille, Cyril Gavoille, David Peleg, David Peleg - 1998
73 Fast Algorithms for constructing t-spanners and paths with stretch t (extended abstract – E Cohen - 1993
71 Compact and Localized Distributed Data Structures – Cyril Gavoille, David Peleg - 2001
49 Routing in Distributed Networks: Overview and Open Problems – Cyril Gavoille - 2001
155 Graph spanners – D Peleg, A A Schäffer - 1989
46 Approximate Distance Labeling Schemes – Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg - 2000
136 Sparse partitions – B Awerbuch, D Peleg - 1990
138 ON A PROBLEM OF GRAPH THEORY – P. Erdős, et al. - 1966
61 Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions – Noga Alon, Moni Naor - 1996
40 Near-linear time construction of sparse neighborhood covers – Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg - 1998
71 Compact Distributed Data Structures for Adaptive Routing – Baruch Awerbuch, Amotz Bar-noy, Nathan Linial, David Peleg - 1989