**DIMACS - Series in Discrete Mathematics and Theoretical Computer Science**

Volume: 7;
1992;
179 pp;
Hardcover

MSC: Primary 05; 68; 90;
**Print ISBN: 978-0-8218-6596-5
Product Code: DIMACS/7**

List Price: $42.00

Individual Member Price: $33.60

# On-line Algorithms

Share this page *Edited by *
*Lyle A. McGeoch; Daniel D. Sleator*

A co-publication of the AMS, DIMACS, and Association for Computing Machinery

This volume contains the proceedings of the Workshop on On-line Algorithms held at the DIMACS Center at Rutgers University in February 1991. Presenting results in the theory of on-line algorithms, the articles discuss a broad range of problems. Most of the papers are based on competitive (worst-case) analysis of on-line algorithms, but some papers consider alternative approaches to on-line analysis. A critical question examined by some of the authors is how to modify competitive analysis to better reconcile the theory and practice of on-line algorithms. Many of the papers examine the ways in which randomization can be used to yield algorithms with improved performance. This book is aimed primarily at specialists in algorithm analysis, but most of the articles present clear expositions of previous work.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).