## On-line algorithms: proceedings of a DIMACS workshop, February 11-13, 1991 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

The Server Problem and Online Games | 11 |

The Harmonic Online AServer Algorithm is Competitive | 65 |

The ATServer Dual and Loose Competitiveness for Paging | 77 |

Copyright | |

8 other sections not shown

### Other editions - View all

### Common terms and phrases

1992 American Mathematical amortized cost analysis binary tree Blue cost c-competitive CH(M Chrobak competitive algorithm competitive factor competitive ratio complete binary trees Computer Science Volume configuration conjecture consider define denote deterministic algorithm distance eject Equipoise finite finite-cost follows game Q grandparent graph coloring graph G greedy algorithm group testing initial tree input interval graphs Kierstead left path Lemma log2 lookahead lower bound Mathematics Subject Classification McGeoch memoryless metric space move multigraph multisets oblivious adversary offline server offset function on-line algorithm on-line coloring on-line games on-line graph on-line problems operation optimal partition pop path popped nodes potential function Proc processor Proof pseudo-cost pure nodes randomized algorithm randomized on-line Red cost request sequence resetting right ancestors rithm robot rotations sequence of requests server problem shaped sequence Sleator spanning tree splay trees strategy subset Tarjan Theorem Theoretical Computer Science tree player Union-Find Union-Find problem vertex vertices