Amortized efficiency of list update and paging rules
Communications of the ACM
A model for hierarchical memory
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Cache and memory hierarchy design: a performance-directed approach
Cache and memory hierarchy design: a performance-directed approach
Two results on the list update problem
Information Processing Letters
Journal of Algorithms
Strongly competitive algorithms for paging with locality of reference
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A lower bound for randomized list update algorithms
Information Processing Letters
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
A combined BIT and TIMESTAMP algorithm for the list update problem
Information Processing Letters
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Bibliography and reading on CPU cache memories and related topics
ACM SIGARCH Computer Architecture News
Competive Analysis of Randomized Paging Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Empirical investigation of the Markov reference model
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On list update and work function algorithms
Theoretical Computer Science
More on Weighted Servers or FIFO is Better than LRU
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
A competitive online algorithm for the paging problem with "shelf" memory
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
SIGACT news online algorithms column 17
ACM SIGACT News
Hi-index | 0.00 |