Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2002: Algorithms — ESA 2002 pp 152–164Cite as

Two Simplified Algorithms for Maintaining Order in a List

  • Conference paper
  • First Online:

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

Abstract

In the Order-Maintenance Problem, the objective is to maintain a total order subject to insertions, deletions, and precedence queries. Known optimal solutions, due to Dietz and Sleator, are complicated. We present new algorithms that match the bounds of Dietz and Sleator. Our solutions are simple, and we present experimental evidence that suggests that they are superior in practice.

Supported in part by NSF Grants CCR-9800085 and CCR-0105678.

Supported in part by NSF Grant EIA-0112849.

Supported in part by NSF Grant CCR-9820879.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Andersson and O. Petersson. Approximate indexed lists. Journal of Algorithms, 29(2):256–276, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  2. L. Arge and J. Vitter. Optimal dynamic interval management in external memory. In FOCS, 1996.

    Google Scholar 

  3. P. Dietz and D. Sleator. Two algorithms for maintaining order in a list. In STOC, 1987.

    Google Scholar 

  4. P. F. Dietz. Maintaining order in a linked list. In STOC, 1982.

    Google Scholar 

  5. P. F. Dietz, J. I. Seiferas, and J. Zhang. A tight lower bound for on-line monotonic list labeling. In SWAT, 1994.

    Google Scholar 

  6. P. F. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In SWAT, 1990.

    Google Scholar 

  7. A. Itai, A. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In ICALP, 1981.

    Google Scholar 

  8. J. Nievergelt and E.M. Reingold. Binary search trees of bounded balance. SIComp, 2:33–43, 1973.

    MATH  MathSciNet  Google Scholar 

  9. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. In WADS, 1989.

    Google Scholar 

  10. A.K. Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica, 21(1):101–112, May 1984.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. Willard. Inserting and deleting records in blocked sequential files. Technical Report TM81-45193-5, Bell Laboratories, 1981.

    Google Scholar 

  12. D. Willard. Maintaining dense sequential files in a dynamic environment. In STOC, 1982.

    Google Scholar 

  13. D. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In SIGMOD, 1986.

    Google Scholar 

  14. D. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2):150–204, 1992.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Computer Science, SUNY Stony Brook, Stony Brook, 11794, NY, USA

    Michael A. Bender & Jack Zito

  2. Courant Institute, New York University, 251 Mercer Street, 10012, New York, NY, USA

    Richard Cole

  3. MIT Laboratory for Computer Science, 200 Technology Square, 02139, Cambridge, MA, USA

    Erik D. Demaine

  4. Google Inc., 2400 Bayshore Parkway, 94043, Mountain View, CA, USA

    Martin Farach-Colton

  5. Department of Computer Science, Rutgers University, 08855, Piscataway, NJ, USA

    Martin Farach-Colton

Authors
  1. Michael A. Bender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard Cole
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erik D. Demaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martin Farach-Colton
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jack Zito
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät II: Mathematik und Naturwissenschaften, Technische Universität Berlin, Strasse des 17. Juni 136, 10623, Berlin, Germany

    Rolf Möhring

  2. Department of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Rajeev Raman

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J. (2002). Two Simplified Algorithms for Maintaining Order in a List. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45749-6_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44180-9

  • Online ISBN: 978-3-540-45749-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation