Optimal prediction for prefetching in the worst case

Amortized efficiency of list update and paging rules

Communications of the ACM

Competitive paging with locality of reference

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Competitive paging algorithms

Journal of Algorithms

Optimal prefetching via data compression (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science

Elements of information theory

Elements of information theory

Universal sequential learning and decision from individual data sequences

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory

Strongly competitive algorithms for paging with locality of reference

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

Software support for speculative loads

ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems

Design and evaluation of a compiler algorithm for prefetching

ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems

Analysis of arithmetic coding for data compression

Information Processing and Management: an International Journal - Special issue on data compression for images and texts

Practical prefetching via data compression

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

Dynamic generation of discrete random variates

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms

Information Theory and Reliable Communication

Information Theory and Reliable Communication

Optimal Prediction for Prefetching in the Worst Case

Optimal Prediction for Prefetching in the Worst Case