1. N. Abramson. Information Theory and Coding. McGraw-Hill, New York, 1983.
2. G.M. Adel'son-Vel'skii and E.M. Landis. An algorithm for the organization of information. Soviet Math. Dokl., 3:1259–1262, 1962.
3. S. Albers. Unpublished result.
4. 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.
5. S. Albers and M. Mitzenmacher. Average case analyses of list update algorithms, with applications to data compression. In Proc. of the 23rd International Colloquium on Automata, Languages and Programming, Springer Lecture Notes in Computer Science, Volume 1099, pages 514–525, 1996.