Skip to main content
SpringerLink
Log in

Online Algorithms

  • Chapter
Book cover Interactive Computation

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. D. Achlioptas, M. Chrobak, J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234:203–218, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Albers. Improved randomized on-line algorithms for the list update problem. SIAM J. Computing 27:670–681, 1998.

    Article  MathSciNet  Google Scholar 

  3. S. Albers, H. Bals. Dynamic TCP acknowledgement: Penalizing long delays. Proc. 14th ACM-SIAM Symp. on Theory of Computing, 47–55, 2003.

    Google Scholar 

  4. S. Albers, L. M. Favrholdt, O. Giel On paging with locality of reference. Proc. 34th ACM Symp. on Theory of Computing, 258–268, 2002.

    Google Scholar 

  5. S. Albers, M. Mitzenmacher. Average case analyses of list update algorithms, with applications to data compression. Algorithmica 21:312–329, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  6. S. Albers, B. von Stengel, R. Werchner. A combined BIT and TIMESTAMP algorithm for the list update problem. Information Processing Letters 56:135–139, 1995.

    Article  MATH  Google Scholar 

  7. W. Aiello, Y. Mansour, S. Rajagopolan, A. Rosén. Competitive queue policies for differentiated services. Proc. INFOCOM, 431–440, 2000.

    Google Scholar 

  8. C. Ambühl. Offline list update is NP-hard. Proc. 8th Annual European Symp. on Algorithms, Springer LNCS 1879, 42–51, 2001.

    Google Scholar 

  9. C. Ambühl, B. Gärtner, B. von Stengel. Towards new lower bounds for the list update problem. Theoretical Computer Science 268:3–16, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  10. N. Andelman, Y. Mansour, A. Zhu. Competitive queueing policies in QoS switches. Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, 761–770, 2003.

    Google Scholar 

  11. A. Archer, C. Papadimitriou, K. Talwar, E. Tardos. An approximate truthful mechanism for combinatorial auctions with single parameter agents. Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, 205–214, 2003.

    Google Scholar 

  12. Y. Azar, Y. Richter. Management of multi-queue switches in QoS networks. Proc. 35th Annual ACM Symp. on Theory of Computing, 82–89, 2003.

    Google Scholar 

  13. N. Bansal, L. Fleischer, T. Kimbrel, M. Mahdian, B. Schieber, M. Sviridenko. Further improvements in competitive guarantees for QoS buffering. Proc. 31st Int’l Colloquium on Automata, Languages and Programming, Springer LNCS 3142, 196–207, 2004.

    Google Scholar 

  14. Y. Bartal, A. Blum, C. Burch, A. Tomkins. A polylog(n)-competitive algorithm for metrical task systems. Proc. 29th Annual ACM Symp. on Theory of Computing, 711–719, 1997.

    Google Scholar 

  15. Y. Bartal, B. Bollobás, M. Mendel. A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems. Proc. 42nd IEEE Annual Symp. on Foundations of Computer Science, 396–405, 2001.

    Google Scholar 

  16. Z. Bar-Yossef, K. Hildrum, F. Wu. Incentive-compatible online auctions for digital goods. Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms, 964–970, 2002.

    Google Scholar 

  17. L. A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems J. 5:78–101, 1966.

    Article  Google Scholar 

  18. S. Ben-David, A. Borodin. A new measure for the study of on-line algorithms. Algorithmica 11:73–91, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  19. S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica 11:2–14, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  20. J. L. Bentley, D. S. Sleator, R. E. Tarjan, V. K. Wei. A locally adaptive data compression scheme. Comm. ACM 29:320–330, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  21. A. Blum, S. Chawla, A. Kalai. Static optimality and dynamic search-optimality in lists and trees. Algorithmica 36:249–260, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  22. A. Blum, V. Kumar, A. Rudra, F. Wu. Online learning in online auctions. Proc. 14th Annual ACM-SIAM Symp. on Discrete Algorithms, 202–204, 2003.

    Google Scholar 

  23. A. Borodin, R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, Cambridge, 1998.

    MATH  Google Scholar 

  24. A. Borodin, S. Irani, P. Raghavan, B. Schieber. Competitive paging with locality of reference. J. Computer and System Sciences 50:244–258, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  25. A. Borodin, N. Linial, M. Saks. An optimal online algorithm for metrical task systems. J. ACM 39:745–763, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  26. J. Boyar, K. S. Larsen, M. N. Nielsen. The accommodating function: A generalization of the competitive ratio. SIAM J. on Computing 31:233–258, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  27. M. Burrows, D. J. Wheeler. A block-sorting lossless data compression algorithm. DEC SRC Research Report 124, 1994.

    Google Scholar 

  28. A. Chou, J. Cooperstock, R. El Yaniv, M. Klugerman, T. Leighton. The statistical adversary allows optimal money-making trading strategies. Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, 467–476, 1995.

    Google Scholar 

  29. M. Chrobak, L. L. Larmore. An optimal online algorithm for k servers on trees. SIAM J. on Computing 20:144–148, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  30. M. Chrobak, J. Noga. LRU is better than FIFO. Algorithmica 23:180–185, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  31. D. Coppersmith, P. Doyle, P. Raghavan, M. Snir. Random walks on weighted graphs, and applications to on-line algorithms. J. ACM 40:421–453, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  32. P. J. Denning. The working set model of program behavior. Comm. ACM 11:323–333, 1968.

    Article  Google Scholar 

  33. P. J. Denning. Working sets past and present. IEEE Trans. Software Engineering 6:64–84, 1980.

    Google Scholar 

  34. D. R. Dooly, S. A. Goldman, D. S. Scott. On-line analysis of the TCP acknowledgment delay problem. J. ACM 48:243–273, 2001.

    Article  MathSciNet  Google Scholar 

  35. A. Fiat, A. Goldberg, J. Hartline, A. Karlin. Competitive generalized auctions. Proc. 34th Annual ACM Symp. on Theory of Computing, 72–81, 2002.

    Google Scholar 

  36. A. Fiat, A. Karlin. Randomized and multipointer paging with locality of reference. Proc. 27th Annual ACM Symp. on Theory of Computing, 626–634, 1995.

    Google Scholar 

  37. A. Fiat, R. M. Karp, L. A. McGeoch, D. D. Sleator, N. E. Young. Competitive paging algorithms. J. Algorithms 12:685–699, 1991.

    Article  MATH  Google Scholar 

  38. A. Fiat, M. Mendel. Truly online paging with locality of reference. Proc. 38th Annual Symp. on Foundations of Computer Science, 326–335, 1997.

    Google Scholar 

  39. A. Fiat, M. Mendel. Better algorithms for unfair metrical task systems and applications. Proc. 32nd Annual ACM Symp. on Theory of Computing, 725–734, 2000.

    Google Scholar 

  40. A. Fiat, G. Woeginger. Online Algorithms: The State of the Art, Springer LNCS 1442, 1998.

    Google Scholar 

  41. J. S. Frederiksen, K. S. Larsen. Packet bundling. Proc. 8th Scandinavian Workshop on Algorithm Theory, Springer LNCS 2368, 328–337, 2002.

    Google Scholar 

  42. A. Goldberg, J. Hartline. Competitiveness via consensus. Proc. 14th Annual ACM-SIAM Symp. on Discrete Algorithms, 215–222, 2003.

    Google Scholar 

  43. A. V. Goldberg, D. S. Hartline, A. Karlin, A. Wright. Competitive auctions. Extended version of [44], 2001.

    Google Scholar 

  44. A. V. Goldberg, D. S. Hartline, A. Wright. Competitive auctions of digital goods. Proc. 12th Annual ACM-SIAM Symp. on Discrete Algorithms, 735–744, 2001.

    Google Scholar 

  45. S. Irani, A. R. Karlin, S. Phillips. Strongly competitive algorithms for paging with locality of reference. SIAM J. on Computing 25:477–497, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  46. S. Irani, D. S. Seiden. Randomized algorithms for metrical task systems. Theoretical Computer Science 194:163–182, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  47. B. Kalyanasundaram, K. Pruhs. Speed is as powerful as clairvoyance. J. ACM 47:617–643, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  48. A. R. Karlin, C. Kenyon, D. Randall. Dynamic TCP acknowledgement and other stories about e/(e − 1). Algorithmica 36:209–224, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  49. A. Karlin, S. Phillips, P. Raghavan. Markov paging. SIAM J. on Computing 30:906–922, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  50. Karp R, Raghavan P From a personal communication cited in [62], 1990.

    MathSciNet  Google Scholar 

  51. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, M. Sviridenko. Buffer overflow management in QoS switches. In: Proc. 33rd Annual ACM Symp. on Theory of Computing, 520–529, 2001.

    Google Scholar 

  52. A. Kesselman, Y. Mansour, R. van Stee. Improved competitive guarantees for QoS buffering. Proc. 11th European Symp. on Algorithms, Springer LNCS 2832, 361–372, 2003.

    Google Scholar 

  53. E. Koutsoupias, C. H. Papadimitriou. On the k-server conjecture. J. ACM 42:971–983, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  54. E. Koutsoupias, C. H. Papadimitriou. Beyond competitive analysis. SIAM J. on Computing 30:300–317, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  55. R. Lavi, A. Mu’alem, N. Nisan. Towards a characterization of truthful combinatorial auctions. Proc. 44th Annual IEEE Symp. on Foundations of Computer Science, 574–583, 2003.

    Google Scholar 

  56. R. Lavi, N. Nisan. Competitive analysis of incentive compatible on-line auctions. Proc. 2nd ACM Conf. on Electronic Commerce, 2000.

    Google Scholar 

  57. M. S. Manasse, L. A. McGeoch, D. D. Sleator. Competitive algorithms for on-line problems. Proc. 20th Annual ACM Symp. on Theory of Computing, 322–333, 1988.

    Google Scholar 

  58. L. A. McGeoch, D. D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica 6:816–825, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  59. J. Noga. Private communication, 2001.

    Google Scholar 

  60. P. Raghavan. A statistical adversary for on-line algorithms. On-Line Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 79–83, 1991.

    Google Scholar 

  61. P. Raghavan, M. Snir. Memory versus randomization in on-line algorithms. IBM J. of Research and Development 38:683–708, 1994.

    Article  Google Scholar 

  62. N. Reingold, J. Westbrook, D. D. Sleator. Randomized competitive algorithms for the list update problem. Algorithmica 11:15–32, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  63. S. S. Seiden. A guessing game and randomized online algorithms. Proc. 32nd Annual ACM Symp. on Theory of Computing, 592–601, 2000.

    Google Scholar 

  64. S. S. Seiden. A general decomposition theorem for the k-server problem. Proc. 9th Annual Symp. on Algorithms, Springer LNCS 2161, 86–97, 2001.

    Google Scholar 

  65. D. D. Sleator, R. E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM 28:202–208, 1985.

    Article  MathSciNet  Google Scholar 

  66. D. D. Sleator, R. E. Tarjan. Self-adjusting binary search trees. J. ACM 32:652–686

    Google Scholar 

  67. E. Torng. A unified analysis of paging and caching. Algorithmica 20:175–200, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  68. N. Young. The k-server dual and loose competitiveness for paging. Algorithmica 11:525–541, 1994.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Freiburg, Freiburg, Germany

    Susanne Albers

Authors
  1. Susanne Albers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Brown University, Providence, RI, 02912, USA

    Dina Goldin  & Peter Wegner  & 

  2. Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY, 11794-4400, USA

    Scott A. Smolka

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Albers, S. (2006). Online Algorithms. In: Goldin, D., Smolka, S.A., Wegner, P. (eds) Interactive Computation. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-34874-3_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-34874-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34666-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation