Buying a Constant Competitive Ratio for Paging
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Effectively sharing a cache among threads
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Competitive caching of query results in search engines
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On joining and caching stochastic streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Algorithmic foundations of the internet
ACM SIGACT News
SIGACT news online algorithms column 8
ACM SIGACT News
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
The worst page-replacement policy
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Closing the gap between theory and practice: new measures for on-line algorithm analysis
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Algorithmic foundations of the internet: roundup
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
Hi-index | 0.00 |