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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1099, Issue , 1996, Pages 514-525

  Albers, Susanne ^a   Mitzenmacher, Michael ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DATA COMPRESSION;

AVERAGE-CASE ANALYSIS; COMPRESSION ALGORITHMS; MEMORYLESS SOURCE; MOVE-TO-FRONT; ON-LINE ALGORITHMS; PERFORMANCE RATIO; SEQUENTIAL SEARCH; UPDATE ALGORITHMS;

HEURISTIC ALGORITHMS;

EID: 84877947090     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_155     Document Type: Conference Paper

References (16)

1. S. Albers. Improved randomized on-line algorithms for the list update problem. In Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 412-419, 1995.
2. J.L. Bentley and C.C. McGeoch. Amortized analyses of self-organizing sequential search heuristics. Communication of the ACM, 28:404-411, 1985.
3. J.L. Bentley, D.S. Sleator, R.E. Tarjan and V.K. Wei. A locally adaptive data compression scheme. Communication of the ACM, 29:320-330, 1986.
4. M. Burrows and D.J. Wheeler. A block-sorting lossless data compression algorithm. DEC SRC Research Report 124, 1994.
5. F.R.K. Chung, D.J. Hajela and P.D. Seymour. Self-organizing sequential search and Hubert's inequality. Proc. 17th Annual Symposium on the Theory of Computing, pages 217-223, 1985.
6. P. Elias. Universal codeword sets and the representation of the integers. IEEE Transactions on Information Theory, 21:194-203, 1975.
7. G.H. Gönnet, J.I. Munro and H. Suwanda. Towards self-organizing linear search. In Proc. 19th Annual IEEE Symposium on Foundations of Computer Science, pages 169-174, 1979.
8. D. Grinberg, S. Rajagopalan, R. Venkatesan and V.K. Wei. Splay trees for data compression. In Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 522-530, 1995.
9. G.H. Hardy, J.E. Littlewood and G. Polya. Inequalities. Cambridge University Press, Cambridge, England, 1967.
10. S. Irani. Two results on the list update problem. Information Processing Letters, 38:301-306, 1991.
11. R. Karp and P. Raghavan. From a personal communication cited in [13].
12. R. Rivest. On self-organizing sequential search heuristics. Communication of the ACM, 19:63-67, 1976.
13. N. Reingold, J. Westbrook and D.D. Sleator. Randomized competitive algorithms for the list update problem. AJgorithmica, 11(1):15-32, 1994.
14. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202-208, 1985.
15. B. Teia. A lower bound for randomized list update algorithms. Information Processing Letters, 47:5-9, 1993.
16. 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.Ζ.