Average case analyses of list update algorithms, with applications to data compression

Algorithmica (New York)

Volumn 21, Issue 3, 1998, Pages 312-329

  Albers, S ^a   Mitzenmacher, M ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

Competitive analysis; Data compression; Entropy; List update problem; On line algorithms; Probability distribution

Indexed keywords

EID: 0008226710     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009217     Document Type: Article

References (19)

1. S. Albers. Improved randomized on-line algorithms for the list update problem. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 412-419, 1995.
2. R. Bachrach and R. El-Yaniv. Online list accessing algorithms and their applications: recent empirical evidence. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 53-62, 1997.
3. J.L. Bentley and C.C. McGeoch. Amortized analyses of self-organizing sequential search heuristics. Communications of the ACM, 28:404-411, 1985.
4. J.L. Bentley, D.S. Sleator, R.E. Tarjan, and V.K. Wei. A locally adaptive data compression scheme. Communications of the ACM, 29:320-330, 1986.
5. M. Burrows and D.J. Wheeler. A Block-Sorting Lossless Data Compression Algorithm. DEC SRC Research Report 124, 1994.
6. F.R.K. Chung, D.J. Hajela, and P.D. Seymour. Self-organizing sequential search and Hilbert's inequality. In Proceedings of the 17th Annual Symposium on the Theory of Computing, pages 217-223, 1985.
7. P. Elias. Universal codeword sets and the representation of the integers. IEEE Transactions on Information Theory, 21:194-203, 1975.
8. G.H. Gonnet, J.I. Munro, and H. Suwanda. Exegesis of self-organizing linear search. SIAM Journal on Computing, 10:613-637, 1981.
9. D. Grinberg, S. Rajagopalan, R. Venkatesan, and V.K. Wei. Splay trees for data compression. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 522-530, 1995.
10. G.H. Hardy, J.E. Littlewood, and G. Polya. Inequalities. Cambridge University Press, Cambridge, 1994.
11. S. Irani. Two results on the list update problem. Information Processing Letters, 38:301-306, 1991.
12. N. Kahale. Large Deviation Bounds for Markov Chains. DIMACS Technical Report 94-39.
13. R. Karp and P. Raghavan. From a personal communication cited in [14].
14. N. Reingold, J. Westbrook, and D.D. Sleator. Randomized competitive algorithms for the list update problem. Algorithmica, 11(1):15-32, 1994.
15. R. Rivest. On self-organizing sequential search heuristics. Communications of the ACM, 19:63-67, 1976.
16. A. Shwartz and A. Weiss. Large Deviations for Performance Analysis: Queues, Communications, and Computing. Chapman and Hall, London, 1995.
17. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
18. B. Teia. A lower bound for randomized list update algorithms. Information Processing Letters, 47:5-9, 1993.
19. I.H. Witten and T. Bell. The Calgary/Canterbury text compression corpus. Anonymous ftp from ftp.cpsc.ucalgary.ca : /pub/text.compression/corpus/text.compression.corpus.tar.Z.