1![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 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](https://www.pdfsearch.io/img/0458b591e9d2b58b24fce5b093ca833c.jpg) | Add to Reading ListSource URL: www14.in.tum.de- Date: 2013-11-25 10:58:23
|
---|
2![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 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](https://www.pdfsearch.io/img/95953ea829bb31cc1815907b21f6e9df.jpg) | Add to Reading ListSource URL: www14.in.tum.de- Date: 2013-11-25 11:06:51
|
---|
3![Semi-Online Scheduling Revisited∗ Susanne Albers† Matthias Hellwig‡ Abstract Semi-Online Scheduling Revisited∗ Susanne Albers† Matthias Hellwig‡ Abstract](https://www.pdfsearch.io/img/afe78c657a4dca0878abc13d7bc7fa60.jpg) | Add to Reading ListSource URL: www14.in.tum.de- Date: 2013-11-25 10:57:08
|
---|
4![Page Replacement for General Caching Problems Susanne Albers Sanjeev Arora y Abstract Page Replacement for General Caching Problems Susanne Albers Sanjeev Arora y Abstract](https://www.pdfsearch.io/img/637ba3c8bab7267cd1dd93b420d88054.jpg) | Add to Reading ListSource URL: www14.in.tum.de- Date: 2013-11-25 11:05:19
|
---|
5![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 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](https://www.pdfsearch.io/img/5ceb1e7b891178bac6aca6e67e7dd651.jpg) | Add to Reading ListSource URL: www14.in.tum.de- Date: 2013-11-25 11:07:22
|
---|
6![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 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](https://www.pdfsearch.io/img/8e5721c4dc781771a81c68716c2ba924.jpg) | Add to Reading ListSource URL: ls2-www.cs.uni-dortmund.de- Date: 2001-06-06 07:30:09
|
---|
7![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 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](https://www.pdfsearch.io/img/ca9c2b64417b2e86440b1b040940db6c.jpg) | Add to Reading ListSource URL: www14.in.tum.deLanguage: English - Date: 2013-11-25 11:07:34
|
---|