Approximate Distance Oracles (2001)

by Mikkel Thorup , Uri Zwick
Citations:154 - 6 self

Documents Related by Co-Citation

90 Compact Routing with Minimum Stretch – Lenore Cowen
149 Compact routing schemes – Mikkel Thorup, Uri Zwick
83 Distance Labeling in Graphs – Cyril Gavoille, David Peleg, Stéphane, Pérennes, Ran Raz - 2000
60 Fast algorithms for constructing t-spanners and paths with stretch t.SIAMJ.Comput – E Cohen - 1998
53 Space-Efficiency for Routing Schemes of Stretch Factor Three – Cyril Gavoille, Cyril Gavoille, Marc Gengler, Marc Gengler - 1997
67 Routing in Trees – Pierre Fraigniaud, Cyril Gavoille - 2001
211 Distributed Computing: A Locality-Sensitive Approach – D Peleg - 2000
136 Graph spanners – D Peleg, A A Schäffer - 1989
66 Routing with Polynomial Communication-Space Tradeoff – Baruch Awerbuch, David Peleg - 1993
120 ON A PROBLEM OF GRAPH THEORY – P. Erdős, et al. - 1966
53 Compact Routing Schemes With Low Stretch Factor – Tamar Eilam, Tamar Eilam, Cyril Gavoille, Cyril Gavoille, David Peleg, David Peleg - 1998
60 Improved routing strategies with succinct tables – B Awerbuch, A Bar-Noy, N Linial, D Peleg - 1990
64 All Pairs Almost Shortest Paths – Dorit Dor, Shay Halperin, Uri Zwick - 1996
45 Routing in Distributed Networks: Overview and Open Problems – Cyril Gavoille - 2001
59 Compact and Localized Distributed Data Structures – Cyril Gavoille, David Peleg - 2001
123 Sparse partitions – Baruch Awerbuch, David Peleg - 1990
55 Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions – Noga Alon, Moni Naor - 1996
31 Near-linear time construction of sparse neighborhood covers – Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg - 1998
144 On sparse spanners of weighted graphs – I Althöfer, G Das, D P Dobkin, D Joseph, J Soares - 1993