Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line algorithms for cache sharing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random walks on weighted graphs and applications to on-line algorithms
Journal of the ACM (JACM)
Competitive k-server algorithms
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Data replication for mobile computers
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Adaptive algorithms for PASO systems
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A probabilistic approach to the problem of automatic selection of data representations
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Optimal prefetching via data compression
Journal of the ACM (JACM)
Journal of the ACM (JACM)
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
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On-line learning and the metrical task system problem
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Minimizing stall time in single and parallel disk systems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Minimization of Communication Cost Through Caching in Mobile Environments
IEEE Transactions on Parallel and Distributed Systems
Competitive Analysis of Caching in Distributed Databases
IEEE Transactions on Parallel and Distributed Systems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On-line choice of on-line algorithms
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Distributed paging for general networks
Proceedings of the seventh 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
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Linear programs for randomized on-line algorithms
SODA '94 Proceedings of the fifth 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
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Competitive algorithms for multilevel caching and relaxed list update
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for dynamic storage allocation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Bounding the diffuse adversary
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line complexity of monotone set systems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Better algorithms for unfair metrical task systems and applications
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Caching in networks (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Connection caching under various models of communication
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
On-line Learning and the Metrical Task System Problem
Machine Learning
On Optimal Replacement of Nonuniform Cache Objects
IEEE Transactions on Computers
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
Can entropy characterize performance of online algorithms?
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal prefetching and caching for parallel I/O sytems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Lookahead Scheduling Requests for Multisize Page Caching
IEEE Transactions on Computers
A randomized online algorithm for bandwidth utilization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed caching independent of the network size
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A general decomposition theorem for the k-server problem
Information and Computation
Multimedia Information Delivery Over Wireless Channels
Multimedia Tools and Applications
PC-OPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems
IEEE Transactions on Computers
Online paging with arbitrary associativity
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Paging on a RAM with Limited Resources
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A New Competitive Analysis of Randomized Caching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On Multicriteria Online Problems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Online Algorithms for Caching Multimedia Streams
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A General Decomposition Theorem for the k-Server Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Online Scheduling for Sorting Buffers
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Randomized online multi-threaded paging
Nordic Journal of Computing
distributed cooperation and adversity: complexity trade-offs
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Work-competitive scheduling for cooperative computing with dynamic groups
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
More on randomized on-line algorithms for caching
Theoretical Computer Science
On Randomization In Online Computation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Theoretical Framework for Memory-Adaptive Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Improving performance by cache driven memory management
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Connection caching: model and algorithms
Journal of Computer and System Sciences
SIGACT news online algorithms column 2
ACM SIGACT News
A Randomized Online Algorithm for Bandwidth Utilization
Journal of Scheduling
Randomized k-server algorithms for growth-rate bounded graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of simple randomized buffer management for parallel I/O
Information Processing Letters
New results on web caching with request reordering
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Online algorithms for prefetching and caching on parallel disks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Journal of Scheduling - Special issue: On-line algorithm part I
Competitive algorithms for the dynamic selection of component implementations
IBM Systems Journal
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Combining request scheduling with web caching
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Competitive caching of query results in search engines
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized k-server algorithms for growth-rate bounded graphs
Journal of Algorithms
How (and why) to introduce Monte Carlo randomized algorithms into a basic algorithms course?
Journal of Computing Sciences in Colleges
Teaching the power of randomization using a simple game
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Online pricing for web service providers
Proceedings of the 2006 international workshop on Economics driven software engineering research
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Entropy-based bounds for online algorithms
ACM Transactions on Algorithms (TALG)
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
Paging with connections: FIFO strikes again
Theoretical Computer Science
Comparison and analysis of ten static heuristics-based Internet data replication techniques
Journal of Parallel and Distributed Computing
Adaptive prefetching algorithm in disk controllers
Performance Evaluation
Randomized k-server on hierarchical binary trees
STOC '08 Proceedings of the fortieth 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
Tight competitive ratios for parallel disk prefetching and caching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Design of a remote controlled caching proxy system: architecture, algorithm and implementation
TELE-INFO'05 Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Autonomic query parallelization using non-dedicated computers: an evaluation of adaptivity options
The VLDB Journal — The International Journal on Very Large Data Bases
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Randomized algorithm for the k-server problem on decomposable spaces
Journal of Discrete Algorithms
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Online Paging for Flash Memory Devices
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A study of integrated document and connection caching
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The worst page-replacement policy
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
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 certain new models for paging with locality of reference
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Towards the randomized k-server conjecture: a primal-dual approach
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Metrical task systems and the k-server problem on HSTs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Outperforming LRU via competitive analysis on parametrized inputs for paging
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An O(log k)-competitive algorithm for generalized caching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Reordering buffer management for non-uniform cost models
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Online view maintenance under a response-time constraint
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Improved algorithms for dynamic page migration
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
ONLINEMIN: a fast strongly competitive randomized paging algorithm
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Competitive strategy for on-line leasing of depreciable equipment
Mathematical and Computer Modelling: An International Journal
Computer Science Review
A proof of the optimality of the MIN paging algorithm using linear programming duality
Operations Research Letters
Enriching introductory programming courses with non-intuitive probability experiments component
Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
Engineering efficient paging algorithms
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
The k-resource problem in uniform metric spaces
Theoretical Computer Science
SCALLA: A Platform for Scalable One-Pass Analytics Using MapReduce
ACM Transactions on Database Systems (TODS)
The k-resource problem on uniform and on uniformly decomposable metric spaces
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Energy efficient caching for phase-change memory
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Improved space bounds for strongly competitive randomized paging algorithms
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.01 |