Biased skip lists

Algorithmica (New York)

Volumn 42, Issue 1, 2005, Pages 31-48

  Bagchi, Amitabha ^a   Buchsbaum, Adam L ^b   Goodrich, Michael T ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Biased dictionaries; Searching; Skip lists

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; DYNAMIC PROGRAMMING; GLOSSARIES; PROBABILITY; SET THEORY; TREES (MATHEMATICS);

BIASED DICTIONARIES; SEARCHING; SKIP LISTES; WEIGHTED DATA ITEMS;

DATA STRUCTURES;

EID: 17444407403     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1138-6     Document Type: Article

References (24)

1. N. Abramson. Information Theory and Coding. McGraw-Hill, New York, 1963.
2. G. M. Adel'son-Vel'skii and Y. M. Landis. An algorithm for the organisation of information. Doklady Akademii Nauk SSSR, 146:263-6, 1962. English translation in Soviet Mathematics Doklady 3:1259-62, 1962.
3. G. M. Adel'son-Vel'skii and Y. M. Landis. An algorithm for the organisation of information. Doklady Akademii Nauk SSSR, 146:263-6, 1962. English translation in Soviet Mathematics Doklady 3:1259-62, 1962.
4. J. Bell and G. Gupta. Evaluation of self-adjusting binary search tree techniques. Software Practice and Experience, 23(4):369-82, 1993.
5. S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees. SIAM Journal on Computing, 14(3):545-68, 1985.
6. Y.-J. Chiang and R. Tamassia. Dynamization of the trapezoid method for planar point location in monotone subdivisions. International Journal of Computational Geometry and Applications, 2(3):311-33, 1992.
7. E. Cohen and H. Kaplan. Proactive caching of DNS records: addressing a performance bottleneck. In Proc. 2001 Symp. on Applications and the Internet (SAINT), pages 85-92. IEEE, New York, 2001.
8. F. Ergun, S. C. Sahinalp, I. Sharp, and R. K. Sinha. Biased dictionaries with fast inserts/deletes. In P roc. 33rd ACM Symp. on Theory of Computing, pages 483-91, 2001.
9. F. Ergun, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased skip lists for highly skewed access patterns. In Proc. 3rd Workshop on Algorithm Engineering and Experiments, pages 216-29. Volume 2153 of Lecture Notes in Computer Science. Springer, Berlin, 2001.
10. J. Feigenbaum and R. E. Tarjan. Two new kinds of biased search trees. Bell System Technical Journal, 62(10):3139-58, 1983.
11. M. T. Goodrich and R. Tamassia. Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations. Journal of Algorithms, 23:51-73, 1997.
12. S. D. Gribble and E. A. Brewer. System design issues for internet middleware services: deductions from a large client trace. In Proc. 1st USENIX Symp. on Internet Technologies and Systems, 1997.
13. L. I. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symp. on Foundations of Computer Science, pages 8-21, 1978.
14. S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatics, 17:157-84, 1982.
15. D. E. Knuth. Optimum binary search trees. Acta Informatica, 1:14-25, 1971.
16. D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
17. C. Martínez and S. Roura. Optimal and nearly optimal static weighted skip lists. Technical Report LSI-95-34-R, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, 1995. http://www.lsi.upc.es/~roura/techreps.html.
18. K. Mehlhom and S. Näher. Algorithm design and software libraries: Recent developments in the LEDA project. In Proc, IFIP 12th World Computer Congress, volume 1, pages 493-505. Elsevier, Amsterdam, 1992.
19. J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, pages 367-75, 1992.
20. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668-76, June 1990.
21. R. Seidel and C. R. Aragon. Randomized search trees. Algorithmica, 16(4/5):464-97, 1996.
22. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-91, 1983.
23. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-86, 1985.
24. W. Stallings. Operating Systems: Internals and Design Principles, 4th edition. Prentice-Hall, Englewood Cliffs, NJ, 2001.