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
A locally adaptive data compression scheme
Communications of the ACM
The linearity of first-fit coloring of interval graphs
SIAM Journal on Discrete Mathematics
An on-line graph coloring algorithm with sublinear performance ratio
Discrete Mathematics
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
New results on server problems
SIAM Journal on Discrete Mathematics
Two results on the list update problem
Information Processing Letters
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Strongly competitive algorithms for paging with locality of reference
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Piecemeal learning of an unknown environment
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
A lower bound for randomized list update algorithms
Information Processing Letters
Randomized Algorithms for Multiprocessor Page Migration
SIAM Journal on Computing
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
A combined BIT and TIMESTAMP algorithm for the list update problem
Information Processing Letters
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On-line algorithms for Steiner tree problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
Improved Randomized On-Line Algorithms for the List Update Problem
SIAM Journal on Computing
New on-line algorithms for the page replication problem
Journal of Algorithms
The polygon exploration problem: a new strategy and a new analysis technique
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
On-line generalized Steiner problem
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
Experimental studies of access graph based heuristics: beating the LRU standard?
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A competitive strategy for learning a polygon
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On-line search in a simple polygon
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
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Exploring unknown environments with obstacles
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fast linear expected-time alogorithms for computing maxima and convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Developments from a June 1996 seminar on Online algorithms: the state of the art
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
On the Dynamic Allocation of Mobile Agents by On-Line Task Scheduling
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
| Hi-index | 0.00 |
In this paper we survey results on the design and analysis of online algorithms, focusing on problems where graphs and graph-theoretic concepts have proven particularly useful in the formulation or in the solution of the problem. For each of the problems addressed, we also present important open questions.