Skip to main content
SpringerLink
Log in
Book cover

International Conference on High-Performance Computing

HiPC 1999: High Performance Computing – HiPC’99 pp 212–216Cite as

A Deterministic Online Algorithm for the List-Update Problem

  • Conference paper

  • 261 Accesses

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

Abstract

An on-line algorithm for the list update problem has been proposed and is shown to be 2-competitive under any sequence of access requests. The simpler version of the algorithm can be easily and efficiently implemented. Further, using this algorithm as a procedure in data compression technique it is possible to obtain better compression ratio than other known algorithms.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Albers,S.: Competitive Online Algorithms. BRICS Lecture Series (1996)

    Google Scholar 

  2. Albers, S., Mitzenmacher, M.: Average case analysis of list update algorithms, with applications to data compression. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 514–525, 682–693. Springer, Heidelberg (1996)

    Google Scholar 

  3. Bentley, J.L., McGeoch, C.C.: Amortized analyses of self-organizing sequential search heuristics. Communications of the ACM 28, 404–411 (1985)

    Article  Google Scholar 

  4. Bentley, J.L., Sleator, D.S., Tarjan, R.E., Wei, V.K.: A locally adaptive data compression scheme. Communications of the ACM 29, 320–330 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  5. Elias, P.: Universal codeword sets and the representation of the integers. IEEE Trans on Information Theory 21, 194–203 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  6. Reingold, N., Westbrook, J.: Off-line algorithm for the list update problem. Information Processing Letters 60, 75–80 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Indian Institute of Technology, Kanpur, 208 016, India

    Hiranjyoti Mahanta & Phalguni Gupta

Authors
  1. Hiranjyoti Mahanta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Phalguni Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Engineering, University of Illinois at Chicago, 851 South Morgan Street, IL 60607-7043, Chicago

    Prith Banerjee

  2. Department of Electrical Engineering, University of Southern California, CA 90089-2562, Los Angeles, USA

    Viktor K. Prasanna

  3. Indian Statistical Institute, ACM Unit, 700 108, Kolkata, India

    Bhabani P. Sinha

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mahanta, H., Gupta, P. (1999). A Deterministic Online Algorithm for the List-Update Problem. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46642-0_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66907-4

  • Online ISBN: 978-3-540-46642-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation