Skip to main content
SpringerLink
Log in

Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure

  • Conference paper
  • First Online:
STACS 2003 (STACS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2607))

Included in the following conference series:

Abstract

This paper presents a data structure providing the usual dictionary operations, i.e. Contains, Insert, Delete. This data structure named Jumplist is a linked list whose nodes are endowed with an additional pointer, the so-called jump pointer. Algorithms on jumplists are based on the jump-and-walk strategy: whenever possible use to the jump pointer to speed up the search, and walk along the list otherwise. The main features of jumplists are the following. They perform within a constant factor of binary search trees. Randomization makes their dynamic maintenance easy. Jumplists are a compact data structure since they provide rank-based operations and forward iterators at a cost of three pointers/integers per node. Jumplists are trivially built in linear time from sorted linked lists.

Extended abstract. Due to space limitations, all proofs have been omitted. Refer to [1] for the full paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hervé Brönnimann, Frédéric Cazals and Marianne Durand. Randomized jumplists: A jump-and-walk dictionary data structure. Research Report RR-xxxx, INRIA, 2003.

    Google Scholar 

  2. M. Abramowitz and I. A. Stegun. Handbook of Mathematical Functions. Dover, 1973. A reprint of the tenth National Bureau of Standards edition, 1964.

    Google Scholar 

  3. N. Amenta, S. Choi, T. K. Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 213–222, 2000.

    Google Scholar 

  4. Nina Amenta and Marshall Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom., 22(4):481–504, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. Aragon and R. Seidel. Randomized search trees. In Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci., pages 540–545, 1989.

    Google Scholar 

  6. Jean-Daniel Boissonnat and Frédéric Cazals. Smooth surface reconstruction via natural neighbour interpolation of distance functions. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 223–232, 2000.

    Google Scholar 

  7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  8. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.

    MATH  Google Scholar 

  9. Olivier Devillers. Improved incremental randomized Delaunay triangulation. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 106–115, 1998.

    Google Scholar 

  10. P. Flajolet and A. M. Odlyzko. Singularity analysis of generating functions. SIAM J. Disc. Math., 3(2):216–240, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  11. G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, 1991.

    Google Scholar 

  12. D. H. Greene and D. E. Knuth. Mathematics for the analysis of algorithms. Birkhäuser, Boston, 1982.

    Google Scholar 

  13. H.-K. Hwang. Théorèmes limites pour les structures combinatoires et les fonctions arithmetiques. PhD thesis, Éecole Polytechnique, Palaiseau, France, December 1994.

    Google Scholar 

  14. Donald E. Knuth. The Art of Computer Programming, Vol 3., @nd Edition. Addison-Wesley, 1998.

    Google Scholar 

  15. H. M. Mahmoud. Evolution of random search trees. Wiley, 1992.

    Google Scholar 

  16. C. Martínez and S. Roura. Randomized binary search trees. J. Assoc. Comput. Mach., 45(2), 1998.

    Google Scholar 

  17. J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In SODA, Orlando, Florida, United States, 1992.

    Google Scholar 

  18. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668–676, 1990.

    Article  MathSciNet  Google Scholar 

  19. S. Roura. An improved master theorem for divide-and-conquer recurrences. J. Assoc. Comput. Mach., 48(2), 2001.

    Google Scholar 

  20. R. Sedgewick. Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching. Addison-Wesley, third edition, 1998.

    Google Scholar 

  21. R. Sedgewick and P. Flajolet. An Introduction to the Analysis of algorithms. Addison-Wesley, 1996.

    Google Scholar 

  22. R. Sedgewick and P. Flajolet. Analytic combinatorics-symbolic combinatorics. To appear, 2002.

    Google Scholar 

  23. R. Seidel and C. R. Aragon. Randomized search trees. Algorithmica, 16:464–497, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  24. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. ACM, 32(3):652–686, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  25. J. S. Vitter and P. Flajolet. Average-case analysis of algorithms and data structures. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, pages 432–524. Elsevier, Amsterdam, 1990.

    Google Scholar 

  26. N. Wirth. Algorithms + Data Structures = Programs. Prentice-Hall, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Polytechnic University, CIS, Six Metrotech, 11201, Brooklyn, NY, USA

    Hervé Brönnimann

  2. INRIA Sophia-Antipolis, Projet Prisme, F-06902, Sophia-Antipolis, France

    Frédéric Cazals

  3. INRIA Rocquencourt, Projet Algo, F-78153, Le Chesnay, France

    Marianne Durand

Authors
  1. Hervé Brönnimann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frédéric Cazals
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marianne Durand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Freie Universität Berlin, Takusstr. 9, 14195, Berlin, Germany

    Helmut Alt

  2. LIRMM, 161, Rue Ada, 34392, Montpellier Cedex 5, France

    Michel Habib

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brönnimann, H., Cazals, F., Durand, M. (2003). Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-36494-3_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00623-7

  • Online ISBN: 978-3-540-36494-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation