Amortized efficiency of list update and paging rules
Communications of the ACM
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Algorithms for two graph problems: computing maximum-genus imbeddings and the two-server problem
Algorithms for two graph problems: computing maximum-genus imbeddings and the two-server problem
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Online algorithms for locating checkpoints
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Random walks on weighted graphs, and applications to on-line algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The harmonic online K-server algorithm is competitive
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Infinite games: randomization, computability, and applications to online problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Randomized competitive algorithms for the list update problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The Canadian Traveller Problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Data replication for mobile computers
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Reactive synchronization algorithms for multiprocessors
ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
Adaptive algorithms for PASO systems
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Online tracking of mobile users
Journal of the ACM (JACM)
On multiprocessor system scheduling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
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
On algorithm design for metrical task systems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On traversing layered graphs on-line
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Preemptive scheduling of parallel jobs on multiprocessors
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Routing and admission control in general topology networks with Poisson arrivals
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
On page migration and other relaxed task systems
SODA '97 Proceedings of the eighth 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
Tight bounds for dynamic storage allocation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A competitive 3-server algorithm
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
New results on server problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Competitive randomized algorithms for non-uniform problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Competitive tree-structured dictionaries
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Generating adversaries for request-answer games
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The lazy adversary conjecture fails
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On the On-line Number of Snacks Problem
Journal of Global Optimization
On the Dynamic Allocation of Mobile Agents by On-Line Task Scheduling
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Variant of the Arrow Distributed Directory with Low Average Complexity
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Optimal Algorithm for On-Line Palletizing at Delivery Industry
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A New Competitive Analysis of Randomized Caching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
The CNN Problem and Other k-Server Variants
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Decentralized Algorithm for Coordinating Independent Peers: An Initial Examination
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
New Results on the k-Truck Problem
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
DCW '00 Proceedings of the Third International Workshop on Distributed Communities on the Web
Offline List Update is NP-Hard
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Weak Adversaries for the k-Server Problem
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Competitive distributed file allocation
Information and Computation
Non-clair voy ant multiprocessor scheduling of jobs with changing execution characteristics
Journal of Scheduling - Special issue: On-line scheduling
Competitive on-line scheduling with level of service
Journal of Scheduling - Special issue: On-line scheduling
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On the competitive ratio of the work function algorithm for the k-server problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers
Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
Storage-Aware Caching: Revisiting Caching for Heterogeneous Storage Systems
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
A new bound for space bounded server algorithms
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
Competitive Analysis for the On-line Truck Transportation Problem
Journal of Global Optimization
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
Online promise problems with online width metrics
Journal of Computer and System Sciences
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Autonomic query parallelization using non-dedicated computers: an evaluation of adaptivity options
The VLDB Journal — The International Journal on Very Large Data Bases
A Comparison of Performance Measures for Online Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
On the on-line k-taxi problem with limited look ahead
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
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
Performance of a MAC protocol for WDM networks with on- line scheduling
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Cost-aware caching schemes in heterogeneous storage systems
The Journal of Supercomputing
Storage-aware caching: revisiting caching for heterogeneous storage systems
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
High level path planning with uncertainty
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
New results on online replacement problem
WINE'05 Proceedings of the First international conference on Internet and Network Economics
IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
Computer Science Review
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
Controller and estimator for dynamic networks
Information and Computation
Online optimization with switching cost
ACM SIGMETRICS Performance Evaluation Review
A k-server problem with parallel requests and unit distances
Information Processing Letters
Adaptive Search-Based Service Migration with Virtual Moves in Clouds for Mobile Accesses
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |
An on-line problem is one in which an algorithm must handle a sequence of requests, satisfying each request without knowledge of the future requests. Examples of on-line problems include scheduling the motion of elevators, finding routes in networks, allocating cache memory, and maintaining dynamic data structures. A competitive algorithm for an on-line problem has the property that its performance on any sequence of requests is within a constant factor of the performance of any other algorithm on the same sequence. This paper presents several general results concerning competitive algorithms, as well as results on specific on-line problems.