On the Competitiveness of Linear Search
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[2] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[3] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[4] Ronald L. Rivest,et al. On self-organizing sequential search heuristics , 1976, CACM.
[5] Jon Louis Bentley,et al. Amortized analyses of self-organizing sequential search heuristics , 1985, CACM.
[6] John McCabe,et al. On Serial Files with Relocatable Records , 1965 .
[7] Jeffery R. Westbrook,et al. Off-Line Algorithms for the List Update Problem , 1996, Inf. Process. Lett..
[8] Michael A. Langston,et al. Practical in-place merging , 1987, CACM.