J. Aspnes and G. Shah. Skip graphs. In Proceedings of the 14th Annual ACMSIAM Symposium on Discrete Algorithms, pages 384--393, January 2003. See also Shah's Ph.D. dissertation, Yale University, 2003. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Active and Concurrent Topology Maintenance - Xiaozhou Li Jayadev (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Proceedings of the 14th Annual ACMSIAM Symposium on Discrete Algorithms, pages 384--393, January 2003. See also Shah's Ph.D. dissertation, Yale University, 2003.
Concurrent Maintenance of Rings - Xiaozhou Li Jayadev (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 384--393, January 2003.
DPTree: A Balanced Tree Based Indexing Framework for.. - Li, Lee, Sivasubramaniam (2006) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 384 -- 393, January 2003.
Simple Efficient Load Balancing Algorithms for Peer-to-Peer.. - David Karger Mit (2004) (8 citations) (Correct)
No context found.
James Aspnes and Gauri Shah. Skip Graphs. In Proceedings SODA, pages 384--393, 2003.
Brief Announcement: Prefix Hash Tree - Sriram Ramabhadran Sylvia (2004) (2 citations) (Correct)
No context found.
J. Aspnes and G. Shah, Skip Graphs, In ACM-SIAM SODA 2003.
Self-organizing Systems Case Study: peer-to-peer systems - Anceaume, Gradinariu, Roy (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Proceedings of the 14th annual ACM-SIAM symposium on Discrete algorithms (SODA'03), January 2003.
USENIX Association - Usits Th Usenix (1992) (2 citations) (Correct)
No context found.
J. Aspnes and G. Shah. Skip Graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2003.
Multi-dimensional Range Queries in Sensor Networks - Xin Li Young (2003) (11 citations) (Correct)
No context found.
J. Aspnes and G. Shah. Skip Graphs. In Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, January 2003.
A Case Study in Building Layered DHT Applications - Chawathe, Ramabhadran.. (2005) (1 citation) (Correct)
No context found.
Aspnes, J., and Shah, G. Skip graphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003).
BATON: A Balanced Tree Structure for Peer-to-Peer Networks - Jagadish, Ooi, Vu (2005) (1 citation) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Proceeding of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 384--393, 2003.
Advanced Indexing Techniques for Wide-Area Network.. - Li, Bian, Zhang.. (2005) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 384--393, Baltimore, MD, USA, 12--14 Jan. 2003.
Heterogeneity-Aware Distributed Access Structure - Alejandra Gonzalez Beltran (2005) (Correct)
No context found.
J. Aspnes and G. Shah. Skip Graphs. In SODA, 2003.
Supporting Multi-dimensional Range Queries in Peer-to-Peer.. - Yanfeng Shu Beng (2005) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
Brushwood: Distributed Trees in Peer-to-Peer Systems - Chi Zhang Arvind (Correct)
No context found.
J. Aspnes and G. Shah. Skip Graphs. In Proceedings of Symposium on Discrete Algorithms, 2003.
A Self-Repairing Peer-to-Peer System - Kuhn, Schmid, Wattenhofer (Correct)
No context found.
J. Aspnes and G. Shah. Skip Graphs. In Proc. 14th Ann. ACMSIAM Symp. on Discrete Algorithms (SODA), pages 384--393, 2003.
P-Tree: A P2P Index for Resource Discovery Applications - Adina Crainiceanu Prakash (2004) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In SODA, 2003.
Online Balancing of Range-Partitioned Data with.. - Ganesan, Bawa.. (2004) (9 citations) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Proc. SODA, 2003.
A Storage and Indexing Framework for P2P Systems - Adina Crainiceanu Prakash (2004) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In SODA, 2003.
A Peer-to-Peer Replica Location Service Based on A.. - Cai, Chervenak, Frank (2004) (1 citation) (Correct)
No context found.
J. Aspnes, Gauri Shah, "Skip Graphs," presented at Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 2003.
Multi-dimensional Range Queries in Sensor Networks - Xin Li Young (2003) (11 citations) (Correct)
No context found.
J. Aspnes and G. Shah. Skip Graphs. In Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, January 2003.
Pagoda: A Dynamic Overlay Network for Routing.. - Bhargava.. (2004) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In SODA 2003.
Routing Complexity of Faulty Networks - Angel, Benjamini, Ofek, Wieder (2004) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (SODA 2003.
Chord++: Low-Congestion Routing in Chord - Baruch Awerbuch Department (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In Proc. of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
Peer-to-Peer Systems for Prefix Search - Baruch Awerbuch Johns (2003) (4 citations) (Correct)
No context found.
J. Aspnes and G. Shah. Skip graphs. In SODA 2003.
Decentralized Object Location and Routing: A New Networking Paradigm - Zhao (2004) (Correct)
No context found.
Aspnes, J., and Shah, G. Skip graphs. In Proc. of SODA (Baltimore, MD, Jan. 2003), pp. 384--393.
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