Amortized efficiency of list update and paging rules
Communications of the ACM
New results on server problems
SIAM Journal on Discrete Mathematics
Journal of Algorithms
On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Approximation algorithms for NP-hard problems
Page replacement with multi-size pages and applications to Web caching
STOC '97 Proceedings of the twenty-ninth 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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Competive Analysis of Randomized Paging Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Exploiting regularities in Web traffic patterns for cache replacement
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal replacements in caches with two miss costs
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Web caching using access statistics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
A unified analysis of hot video schedulers
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resource augmentation for online bounded space bin packing
Journal of Algorithms
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Resource Augmentation for Online Bounded Space Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
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
Online Algorithms for Caching Multimedia Streams
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Some Algorithmic Problems in Large Networks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Cost-Sensitive Cache Replacement Algorithms
HPCA '03 Proceedings of the 9th International Symposium on High-Performance Computer Architecture
New results on web caching with request reordering
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Algorithmic foundations of the internet
ACM SIGACT News
Cache Replacement Algorithms with Nonuniform Miss Costs
IEEE Transactions on Computers
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Resource augmented semi-online bounded space bin packing
Discrete Applied Mathematics
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Dynamic programming based algorithms for set multicover and multiset multicover problems
Theoretical Computer Science
Caching is hard: even in the fault model
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Cost-aware caching schemes in heterogeneous storage systems
The Journal of Supercomputing
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
(1 + ε)-competitive algorithm for online OVSF code assignment with resource augmentation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
An O(log k)-competitive algorithm for generalized caching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online view maintenance under a response-time constraint
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Algorithmic foundations of the internet: roundup
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Minimizing setup and beam-on times in radiation therapy
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
Lifetime and QoS-aware energy-saving buffering schemes
Journal of Systems and Software
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
Journal of Combinatorial Optimization
| Hi-index | 0.00 |