default search action
DIMACS Workshop: On-Line Algorithms 1991
- Lyle A. McGeoch, Daniel Dominic Sleator:
On-Line Algorithms, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, February 11-13, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 7, DIMACS/AMS 1992, ISBN 978-0-8218-6596-5 - List of Participants. On-Line Algorithms 1991: xi-
- Noga Alon, Richard M. Karp, David Peleg, Douglas B. West:
A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract). 1-10 - Marek Chrobak, Lawrence L. Larmore:
The Server Problem and On-Line Games. 11-64 - Edward F. Grove:
The Harmonic Online K-Server Algorithm in Competitive. 65-76 - Neal Young:
The K-Server Dual and Loose Competitiveness for Paging. 77-78 - Prabhakar Raghavan:
A Statistical Adversary for On-line Algorithms. 79-84 - Hal A. Kierstead, William T. Trotter:
On-line Graph Coloring. 85-92 - Bala Kalyanasundaram, Kirk Pruhs:
Online Weighted Matching. 93-94 - Joan M. Lucas:
On the Competitiveness of Splay Trees: Relations to the Union-Find Problem. 95-124 - Ding-Zhu Du, Frank Kwang-Ming Hwang:
Competitive Group Testing. 125-134 - Jeffery R. Westbrook:
Randomized Algorithms for Multiprocessor Page Migration. 135-150 - Avrim Blum, Prabhakar Raghavan, Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain (Extended Summary). 151-156 - Bala Kalyanasundaram, Kirk Pruhs:
Visual Searching and Mapping. 157-162 - David B. Shmoys, Joel Wein, David P. Williamson:
Scheduling Parallel Machines On-line. 163-166 - Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber:
Competitive Paging with Locality of Reference (Brief Summary). 167-168 - Magnús M. Halldórsson, Mario Szegedy:
Lower Bounds for On-line Graph Coloring. 169-179
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.