Література.

1. Bently, Jl, Sleator, DD, Tarjan, RE, and Wei, VK

A locally adaptive data compression scheme.

Communications of the ACM. 29, 4 (Apr. 1986), 320-330.
2. Gallagen, RG

Information Theory and Reliable Communication.

John Wiley & Sons, New York, 1968.
3. Gallager, RG

Variations on a theme by Huffman.

IEEE Trans.Inform.Theory IT-24, 6 (Nov.1978), 666-674.
4. Jones, DW

An empirical comparison of priority queue and set inplementations.

Communication of the ACM. 29, 4 (Apr. 1986), 300-311.
5. Knuth, DE

Dynamic Huffman coding.

J. Algorithms 6, 2 (Feb. 1985), 163-180.
6. Rubin, F.

Arithmetic stream coding using fixed precision registers.

IEEE Trans.Inform.Theory IT-25, 6 (Nov. 1979), 672-675.
7. Saraswat, V.

Merge trees using splaying - or how to splay in parralel and bottom-up.

PROLOG Digest 5, 22 (Mar. 27, 1987).
8. Sleator, DD, and Tarjan, RE

Self-adjusting binary trees.

In Proceedings of the ACM SIGACT Symposium on Theory of Computing

(Boston, Mass ., Apr.25-27). ACM, New York, 1983, pp.235-245.
9. Tarjan, RE, and Sleator, DD

Self-adjusting binary search trees.

J. ACM 32, 3 (July 1985), 652-686.
10. Vitter, JS

Two papers on dynamic Huffman codes.

Tech.Rep.CS-85-13.Brown University Computer Science,

RI Revised Dec.1986.
11. Welch, TA

A technique for high-performance data compression.

IEEE Comput. 17, 6 (June 1984), 8-19.
12. Witten, IH, Neal, RM, and Cleary, JG

Arithmetic coding for data compression.

Communication of the ACM. 30, 6 (June 1987), 520-540