Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Competitive algorithms for server problems
Journal of Algorithms
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
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
Empirically derived micromodels for sequences of page exceptions
IBM Journal of Research and Development
Strongly competitive algorithms for paging with locality of reference
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Blocking for external graph searching
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On-line algorithms for cache sharing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Optimal prefetching via data compression
Journal of the ACM (JACM)
Adaptive page replacement based on memory reference behavior
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Exploiting regularities in Web traffic patterns for cache replacement
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On algorithm design for metrical task systems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The statistical adversary allows optimal money-making trading strategies
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Experimental studies of access graph based heuristics: beating the LRU standard?
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal prediction for prefetching in the worst case
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Evaluating Server-Assisted Cache Replacement in the Web
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Can competitive analysis be made competitive?
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Approximating the optimal replacement algorithm
Proceedings of the 1st conference on Computing frontiers
Journal of Scheduling - Special issue: On-line algorithm part I
Competitive caching of query results in search engines
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Online Computation with Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
How much information about the future is needed?
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the DMA mapping problem in direct device assignment
Proceedings of the 3rd Annual Haifa Experimental Systems Conference
| Hi-index | 0.00 |