43 citations found. Retrieving documents...
M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp., pages 183--192, July 2001.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents

Compact Name-Independent Routing with Minimum Stretch - Abraham, Gavoille, al. (2004)   (5 citations)  Self-citation (Thorup)   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the 33rd annual ACM Symposium on Theory of Computing (STOC), pages 183--192, 2001.


On Dynamic Shortest Paths Problems - Roditty, Zwick (2004)   Self-citation (Zwick)   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, pages 183--192, 2001.


Dynamic Approximate All-Pairs Shortest Paths In Undirected Graphs - Roditty, Zwick   Self-citation (Zwick)   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of 33rd STOC, pages 183--192, 2001. Full version to appear in the Journal of the ACM.


Exact and Approximate Distances in Graphs - a survey - Zwick (2001)   (8 citations)  Self-citation (Zwick)   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, pages 183-192, 2001.


Compact Name-Independent Routing with Minimum Stretch - Abraham, Gavoille, al. (2004)   (5 citations)  Self-citation (Thorup)   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the 33rd annual ACM Symposium on Theory of Computing (STOC), pages 183--192, 2001.


Compact Routing Schemes - Thorup, Zwick (2001)   (37 citations)  Self-citation (Thorup Zwick)   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001. To appear.


Reachability and Distance Queries via 2-Hop Labels - Cohen, Halperin, Kaplan, Zwick (2002)   (2 citations)  Self-citation (Zwick)   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, pages 183-192, 2001.


A Note on the Nearest Neighbor in Growth-Restricted Metrics - Kirsten Hildrum John   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp., pages 183--192, July 2001.


Another Way to Find the Nearest Neighbor in.. - Hildrum, Kubiatowicz.. (2003)   (4 citations)  (Correct)

No context found.

Mikkel Thorup and Uri Zwick. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp., pages 183--192, 2001.


Distance and Routing Labeling Schemes for Non-Poositively Curved.. - Chepoi (2003)   (Correct)

No context found.

M. Thorup, U. Zwick, Approximate distance oracles, Proc. 33 rd Ann. ACM Symp. on Theory of Computing (STOC


LAND: Stretch (1 + ε) Locality-Aware Networks for.. - Abraham, Malkhi, Dobzinski   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the thirty-third annual ACM symposium on Theory of computing (STOC '01), pages 183--192. ACM Press, 2001.


Distributed Object Location in a Dynamic Network - Hildrum, Kubiatowicz, Rao, Zhao (2004)   (53 citations)  (Correct)

No context found.

Thorup, M., and Zwick, U. Approximate distance oracles. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (July 2001), pp. 183--192.


Routing with Improved Communication-Space Trade-Off - Abraham, Gavoille, Malkhi (2004)   (3 citations)  (Correct)

No context found.

M. Thorup and U. Zwick, Approximate distance oracles, in 33 rd Annual ACM Symposium on Theory of Computing (STOC), July 2001, pp. 183--192.


Distributed Object Location in a Dynamic Network - Hildrum, Kubiatowicz, Zhao (2002)   (53 citations)  (Correct)

No context found.

THORUP, M., AND ZWICK, U. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp. (July 2001), pp. 183--192.


LAND: Stretch (1 + ε) Locality-Aware Networks for.. - Abraham, Malkhi, Dobzinski   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the thirty-third annual ACM symposium on Theory of computing (STOC '01), pages 183--192. ACM Press, 2001.


Another Way to Find the Nearest Neighbor in.. - Hildrum, Kubiatowicz.. (2003)   (4 citations)  (Correct)

No context found.

Mikkel Thorup and Uri Zwick. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp., pages 183--192, 2001.


Low-Distortion Embeddings of Finite Metric Spaces - Indyk, Matousek   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proc. 33rd Annu. ACM Sympos. Theory Comput., pages 183-192, 2001.


Another Way to Find the Nearest Neighbor in.. - Hildrum, Kubiatowicz.. (2003)   (4 citations)  (Correct)

No context found.

Mikkel Thorup and Uri Zwick. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp., pages 183--192, 2001.


Distributed Object Location in a Dynamic Network - Hildrum, Kubiatowicz, Rao, Zhao (2002)   (53 citations)  (Correct)

No context found.

THORUP, M., AND ZWICK, U. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp. (2001), pp. 183--192.


Low-Distortion Embeddings of Finite Metric Spaces - Indyk, Matousek   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proc. 33rd Annu. ACM Sympos. Theory Comput., pages 183-192, 2001.


Distributed Object Location in a Dynamic Network - Hildrum, Kubiatowicz, Rao, Zhao (2002)   (53 citations)  (Correct)

No context found.

THORUP, M., AND ZWICK, U. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp. (July 2001), pp. 183--192.


Compact Routing on Internet-Like Graphs - Dmitri Krioukov Email (2003)   (2 citations)  (Correct)

No context found.

M. Thorup and U. Zwick, "Approximate distance oracles," in Proc. of the 33 rd STOC. ACM, 2001.


A Note on the Nearest Neighbor in Growth-Restricted Metrics - Hildrum, Kubiatowicz, Ma..   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp., pages 183--192, July 2001.


A Note on the Nearest Neighbor in Growth-Restricted Metrics - Hildrum, Kubiatowicz, Ma..   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of the 33th Annual ACM Symp. on Theory of Comp., pages 183--192, July 2001.


Compact Routing on Euclidian Metrics - Abraham, Malkhi (2004)   (Correct)

No context found.

M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 183--192. ACM Press, 2001.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC