Self-Organizing Data Structures (1998)

by Susanne Albers , Jeffery Westbrook
Venue:In
Citations:18 - 0 self

Documents Related by Co-Citation

40 Improved Randomized On-Line Algorithms for the List Update Problem – Susanne Albers - 1995
27 A Combined BIT and TIMESTAMP Algorithm for the List Update Problem – Susanne Albers, Bernhard Von Stengel, Ralph Werchner - 1995
23 Two results on the list update problem – S IRANI - 1991
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
655 Online Computation and Competitive Analysis – A Borodin, R El-Yaniv - 1998
27 A lower bound for randomized list update algorithms – B TEIA - 1993
21 Average Case Analyses of List Update Algorithms, with Applications to Data Compression – S. Albers, M. Mitzenmacher - 1998
731 Amortized Efficiency of List Update and Paging Rules – D D Sleator, R E Tarjan - 1985
4 McGeoch (1985), Amortized analyses of self-organizing sequential search heuristics – J L Bentley, C C
5 Tarjan (1985), Amortized efficiency of list update and paging rules – D D Sleator, R E
39 Randomized Competitive Algorithms for the List Update Problem – Nick Reingold, Jeffery Westbrook, Daniel D. Sleator - 1992
362 Probabilistic computations: Towards a unified measure of complexity – A C Yao - 1977
186 An optimal online algorithm for metrical task systems – Allan Borodin, Nathan Linial, Michael E. Saks - 1992
42 Amortized analyses of self-organizing sequential search heuristics – J L Bentley, C C McGeoch - 1985
9 Self-adjusting k-ary search trees – M Sherk - 1989
3 List update posets – Susanne Albers Bernhard Von Stengel - 1996
14 Off-line Algorithms for The List Update Problem – Nick Reingold, Jeffery Westbrook - 1996
20 On the power of randomization in on-line algorithms. Algorithmica – S Ben-David, A Borodin, R M Karp, G Tardos, A Wigderson
58 Online Computation and Competitive Analysis. Cambridge University Press, The Pitt Building, Trumpington – Allan Borodin, Ran El-Yaniv - 2002