Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for server problems
Journal of Algorithms
Competitive paging with locality of reference
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Application-controlled physical memory using external page-cache management
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Some Distribution-Free Aspects of Paging Algorithm Performance
Journal of the ACM (JACM)
Program Behavior: Models and Measurements
Program Behavior: Models and Measurements
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Minimizing stall time in single and parallel disk systems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Experimental studies of access graph based heuristics: beating the LRU standard?
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Design and analysis of efficient application-specific on-line page replacement techniques
GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
ACM Computing Surveys (CSUR)
Minimizing stall time in single and parallel disk systems
Journal of the ACM (JACM)
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On paging with locality of reference
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A New Competitive Analysis of Randomized Caching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Journal of Scheduling - Special issue: On-line algorithm part I
Strongly competitive algorithms for caching with pipelined prefetching
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Competitive caching of query results in search engines
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On paging with locality of reference
Journal of Computer and System Sciences
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Online Computation with Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Online computation with advice
Theoretical Computer Science
Paging for multi-core shared caches
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Outperforming LRU via competitive analysis on parametrized inputs for paging
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |