Author:
Kniesburges Sebastian,Scheideler Christian
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, January 12-14, pp. 384–393 (2003)
2. Awerbuch, B., Scheideler, C.: Peer-to-peer systems for prefix search. In: Proceedings of the Twenty-second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 123–132. ACM, New York (2003), http://doi.acm.org/10.1145/872035.872053
3. Bayer, R., Unterauer, K.: Prefix b-trees. ACM Trans. Database Syst. 2(1), 11–26 (1977), doi:10.1145/320521.320530
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press/McGraw-Hill (2001)
5. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Mathematical Systems Theory 10, 99–127 (1977)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献