Online List Update
作者： Shahin Kamali
DOI: 10.1007/978-3-642-27848-8_266-2
关键词: Information retrieval 、 List update problem 、 Computer science
摘要:
springer.com
sci-hub.se 参考文章(14)
Shahin Kamali, Alejandro López-Ortiz, A Survey of Algorithms and Models for List Update Space-Efficient Data Structures, Streams, and Algorithms. pp. 251- 266 ,(2013) , 10.1007/978-3-642-40273-9_17
Susanne Albers, Sonja Lauer, On List Update with Locality of Reference international colloquium on automata languages and programming. pp. 96- 107 ,(2008) , 10.1007/978-3-540-70575-8_9
Susanne Albers, Bernhard von Stengel, Ralph Werchner, A combined BIT and TIMESTAMP algorithm for the list update problem Information Processing Letters. ,vol. 56, pp. 135- 139 ,(1995) , 10.1016/0020-0190(95)00142-Y
Boris Teia, A lower bound for randomized list update algorithms Information Processing Letters. ,vol. 47, pp. 5- 9 ,(1993) , 10.1016/0020-0190(93)90150-8
Ronald Rivest, On self-organizing sequential search heuristics Communications of the ACM. ,vol. 19, pp. 63- 67 ,(1976) , 10.1145/359997.360000
Daniel D. Sleator, Robert E. Tarjan, Amortized efficiency of list update and paging rules Communications of The ACM. ,vol. 28, pp. 202- 208 ,(1985) , 10.1145/2786.2793
Shahin Kamali, Alejandro Lopez Ortiz, Better Compression through Better List Update Algorithms data compression conference. pp. 372- 381 ,(2014) , 10.1109/DCC.2014.86
Bernhard von Stengel, Christoph Ambühl, Bernd Gärtner, Optimal lower bounds for projective list update algorithms ACM Transactions on Algorithms. ,vol. 9, pp. 31- ,(2013) , 10.1145/2500120
Susanne Albers, Improved Randomized On-Line Algorithms for the List Update Problem SIAM Journal on Computing. ,vol. 27, pp. 682- 693 ,(1998) , 10.1137/S0097539794277858
J. Ian Munro, On the Competitiveness of Linear Search european symposium on algorithms. pp. 338- 345 ,(2000) , 10.1007/3-540-45253-2_31