On the Value of Coordination in Network Design Susanne Albers∗ Abstract We study network design games where n self-interested agents have to form a network by purchasing links from a given set of edges. We consider Sha

Source URL: www14.in.tum.de

A Combined BIT and TIMESTAMP Algorithm for the List Update Problem Susanne Albers, Bernhard von Stengel, Ralph Werchner International Computer Science Institute, 1947 Center Street, Berkeley, CA 94704, USA Email: falbers

Source URL: www14.in.tum.de

Semi-Online Scheduling Revisited∗ Susanne Albers† Matthias Hellwig‡ Abstract

Source URL: www14.in.tum.de

Page Replacement for General Caching Problems Susanne Albers Sanjeev Arora y Abstract

Source URL: www14.in.tum.de

A Competitive Analysis of the List Update Problem with Lookahead Susanne Albers Abstract We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if

Source URL: www14.in.tum.de

Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows Susanne Albers and Carsten Witt Dept. of Computer Science, Dortmund University, 44221 Dortmund, Germany, -dort

Source URL: ls2-www.cs.uni-dortmund.de

On the In uence of Lookahead in Competitive Paging Algorithms Susanne Albers Abstract We introduce a new model of lookahead for on-line paging algorithms and study several algorithms using this model. A paging algorithm

Source URL: www14.in.tum.de

• Page replacement algorithm
• Virtual memory
• Canonical LR parser