List Update Problem by

We present an optimal on-line algorithm for the List Update Problem when the request sequence has some particular structure.

[1]  Ronald L. Rivest,et al.  On self-organizing sequential search heuristics , 1976, CACM.

[2]  Gaston H. Gonnet,et al.  Exegesis of Self-Organizing Linear Search , 1981, SIAM J. Comput..

[3]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[4]  Jon Louis Bentley,et al.  Amortized analyses of self-organizing sequential search heuristics , 1985, CACM.

[5]  Allan Borodin,et al.  An optimal online algorithm for metrical task systems , 1987, STOC.

[6]  Jeffery R. Westbrook,et al.  Randomized competitive algorithms for the list update problem , 1991, SODA '91.

[7]  Allan Borodin,et al.  Competitive paging with locality of reference , 1991, STOC '91.

[8]  Sandy Irani,et al.  Two Results on the List Update Problem , 1991, Inf. Process. Lett..

[9]  Boris Teia,et al.  A Lower Bound for Randomized List Update Algorithms , 1993, Inf. Process. Lett..

[10]  Alberto Marchetti-Spaccamela,et al.  The Weighted List Update Problem and the Lazy Adversary , 1993, Theor. Comput. Sci..

[11]  Susanne Albers,et al.  A Competitive Analysis of the List Update Problem with Lookahead , 1994, Theor. Comput. Sci..

[12]  Bernhard von Stengel,et al.  Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.

[13]  Susanne Albers,et al.  Improved randomized on-line algorithms for the list update problem , 1995, SODA '95.

[14]  Bernhard von Stengel,et al.  A Combined BIT and TIMESTAMP Algorithm for the List Update Problem , 1995, Inf. Process. Lett..

[15]  B. Stengel,et al.  Efficient Computation of Behavior Strategies , 1996 .

[16]  Jeffery R. Westbrook,et al.  Off-Line Algorithms for the List Update Problem , 1996, Inf. Process. Lett..

[17]  Béla Csaba,et al.  Server Problems and Regular Languages , 1997, Acta Cybern..

[18]  Susanne Albers,et al.  Revisiting the Counter Algorithms for List Update , 1997, Inf. Process. Lett..

[19]  Susanne Albers,et al.  Average Case Analyses of List Update Algorithms, with Applications to Data Compression , 1996, Algorithmica.

[20]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[21]  Bernhard von Stengel,et al.  Optimal Projective Algorithms for the List Update Problem , 2000, ICALP.