A locally adaptive data compression scheme

Communications of the ACM

Volumn 29, Issue 4, 1986, Pages 320-330

  Bentley, Jon Louis ^a   Sleator, Daniel D ^a   Tarjan, Robert E ^b   Wei, Victor K ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - DATA COMPRESSION;

LOCALLY ADAPTIVE DATA COMPRESSION; SELF-ORGANIZING SEQUENTIAL SEARCH; VARIABLE-LENGTH ENCODING OF INTEGERS;

CODES, SYMBOLIC;

EID: 0022698885     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/5684.5688     Document Type: Article

References (26)

1. Bentlev. 1. L. and McGeoch. C. A. Worst-case analvsis of self-oreanizing sequential search heuristics. In Proceedings 20th AIlerton Conference on Communication, Control, and Computing. (Monticello, Ill., Oct. 6-8, 1982). Univ. of Illinois, 452461.]
2. Bentley, J. L., Sleator. D. D. Tarjan, R. E., and Wei, V. K. A locality adaptive data compression scheme. In Proceedings 22nd AIlerton Conference on Communication, Control, and Computing. (Monticello, Ill., Oct. 3-5, 1984), Univ. of Illinois, 233-242.]
3. Bentley, J. L., and Yao, A. C. An almost optima1 algorithm for unbounded searching. Inform. Process. Left, 5, 3 (Aug. 1976), 82-87.]
4. Bitner, J. R. Heuristics that dynamically organize data structures. SZAM J Comput. 8, 1 (Feb. 1979), 82-110.]
5. Brown, M. R. and Tarjan. R. E. Design and analysis of a data structure for representing sorted lists. SIAM 1. Comput. 9, 3 (Aug. 1980), 594-614.]
6. Dijkstra, E. W. A Discipline of Programming. Prentice-Hall, Englewood Cliffs. N.I. 1976.]
7. Elias, P. University codeword sets and representation of the integers. IEEE Trans. Inform. Theory IT-21, 2 (Mar. 1975), 194-203.]
8. Elias. P. Interval and recency-rank source coding: Two on-line adaptive variable-length schemes. IEEE: Trans. Inform. Theory, submitted for publication (198:;
9. Gallager, R. G. Information Theory and Reliable Communicafion. Wiley, New York, 1968.]
10. Gallager, R. G. Variations on a theme by Hoffman. IEEE Trans. Inform. Theory IT-24, 5 (Nov. 1978), 668-674.]
11. Hardy, G. H., Littlewood, J. E., and Polya, G. Inequalities. Cambridge Univ. Press, Cambridge, England. 1967.]
12. Huddleston, S. An efficient scheme for fast local updates in linear lists. Univ. of California, Irvine. 1981.]
13. Huddleston, S., and Meblhorn, K.4 new data structure for representing sorted lists. Acta Inform. 17. 2 (June 19821, 157-184.]
14. Hoffman. D. A. A motbod for the c:onstruction of minimum radondancy codes. In Proceedings of fhe IRE 40, (Sept. 1952), 1098-1101.]
15. Knuth, D. E. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.]
16. Knuth, D. E. Dynamic Hoffman coding. J Algorithms 6, 2 (June 1985), 163-180.]
17. Kosaraju, R. Localized search in sorted lists. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing. (San Francisco. Calif. May 5-7, 1982). ACM, 62-69.]
18. Maier. D., and Salveter, S. C. Hysterical B-trees. Inform. Processing Left. 12, 4 (Aug. 13, 1981), 199-202.]
19. Sleator. D. D. and Tarjan, R. E. Self-adjusting binary trees. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing. (Boston, Mass., Apr. 25-27, 1983), ACM, 235-245.]
20. Sleator. D. D., and Tarjan. R. E. Amortized efficiency of list update rules. In Proceedings of the Sixteenth Annual ACM Symposium on the Theory of Computing. (Washington, D.C., Apr. 30-May 3, 1984), ACM, 488-492.]
21. Sleator, D. D., and Tarjan, R. E. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (Feb. 1985), 202-208.]
22. Sleator, D. D., and Tarjan, R. E. Tarjan binary search trees. /. ACM 32, 3 (July 1985), 652-686.]
23. Tarjan, R. E. Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, Pa., 1983.]
24. Tsakalidis, A. K. AVL-trees for localized search. In Automata, Languages, and Programming, 11th Colloquium. (Antwerp, Belgium, July 16-20, 1984); also Lecture Notes in Computer Science 172. G. Goos and J. Hartmanis, Eds. Springer-Verlag. Berlin, 1984, pp. 473-485.]
25. Vitter. J. S. Design and analysis of dynamic Hoffman coding. In Proceedings of the Twenty-Sixth Annual IEEE Symposium on Foundations of Computer Science. (Portland, Oreg., Oct. 21-23, 1985), IEEE Computer Society, 293-302.]
26. Ziv, J., and Lempel, A. Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory IT-24, 5 (Sept. 1978), 530-536.]