Література. p>
1. Bently, Jl, Sleator, DD, Tarjan, RE, and Wei, VK p>
A locally adaptive data compression scheme. P>
Communications of the ACM. 29, 4 (Apr. 1986), 320-330.
2. Gallagen, RG p>
Information Theory and Reliable Communication. P>
John Wiley & Sons, New York, 1968.
3. Gallager, RG p>
Variations on a theme by Huffman. P>
IEEE Trans.Inform.Theory IT-24, 6 (Nov.1978), 666-674.
4. Jones, DW p>
An empirical comparison of priority queue and set inplementations. P>
Communication of the ACM. 29, 4 (Apr. 1986), 300-311.
5. Knuth, DE p>
Dynamic Huffman coding. P>
J. Algorithms 6, 2 (Feb. 1985), 163-180.
6. Rubin, F. p>
Arithmetic stream coding using fixed precision registers. P>
IEEE Trans.Inform.Theory IT-25, 6 (Nov. 1979), 672-675.
7. Saraswat, V. p>
Merge trees using splaying - or how to splay in parralel and bottom-up. P>
PROLOG Digest 5, 22 (Mar. 27, 1987).
8. Sleator, DD, and Tarjan, RE p>
Self-adjusting binary trees. P>
In Proceedings of the ACM SIGACT Symposium on Theory of Computing p>
(Boston, Mass ., Apr.25-27). ACM, New York, 1983, pp.235-245.
9. Tarjan, RE, and Sleator, DD p>
Self-adjusting binary search trees. P>
J. ACM 32, 3 (July 1985), 652-686.
10. Vitter, JS p>
Two papers on dynamic Huffman codes. P>
Tech.Rep.CS-85-13.Brown University Computer Science, p>
RI Revised Dec.1986.
11. Welch, TA p>
A technique for high-performance data compression. P>
IEEE Comput. 17, 6 (June 1984), 8-19.
12. Witten, IH, Neal, RM, and Cleary, JG p>
Arithmetic coding for data compression. P>
Communication of the ACM. 30, 6 (June 1987), 520-540 p>