|
682
|
R.E.: Amortized efficiency of list update and paging rules
– D D Sleator, Tarjan
- 1985
|
|
99
|
Competitive Distributed File Allocation
– Baruch Awerbuch, Yair Bartal, Amos Fiat
- 1993
|
|
100
|
Competitive Algorithms for Distributed Data Management
– Yair Bartal, Amos Fiat, Yuval Rabani
|
|
57
|
Competitive algorithms for replication and migration problems
– D L Black, D D Sleator
- 1989
|
|
549
|
R.: Online Computation and Competitive Analysis
– A Borodin, El-Yaniv
- 1998
|
|
27
|
Randomized Algorithms For Multiprocessor Page Migration
– Jeffery Westbrook
|
|
38
|
On-line Generalized Steiner Problem
– Baruch Awerbuch , Yossi Azar, Yair Bartal
- 1996
|
|
132
|
On the Power of Randomization in Online Algorithms
– S. Ben-David, A. Borodin, R. Karp, G. Tardos, A. Wigderson
- 1990
|
|
144
|
Comparative models of the file assignment problem
– L W Dowdy, D V Foster
- 1982
|
|
9
|
migration with limited local memory capacity
– Page
- 1995
|
|
25
|
O.: Dynamic file migration in distributed computer systems
– B Gavish, Sheng
- 1990
|
|
19
|
New On-Line Algorithms for the Page Replication Problem
– Susanne Albers, Hisashi Koga
- 1994
|
|
127
|
Competitive algorithms for on-line problems
– M S Manasse, L A McGeoch, D D Sleator
- 1988
|
|
13
|
Page Migration Algorithms Using Work Functions
– Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook
- 1994
|
|
5
|
auf der Heide, Fighting against two adversaries: Page migration in dynamic networks
– M Bienkowski, M Korzeniowski, F Meyer
- 2004
|
|
34
|
Online distributed data management
– C Lund, R Reingold, J Westbrook, D Yan
- 1996
|
|
125
|
Dynamic Steiner tree problem
– Makoto Imase, Bernard M Waxman
- 1991
|
|
55
|
Distributed Paging for General Networks
– Baruch Awerbuch, Yair Bartal, Amos Fiat
- 1996
|
|
154
|
Competitive Paging Algorithms
– Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. Mcgeoch, Daniel D. Sleator, Neal E. Young
- 1991
|
