Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR09-097 | 2nd September 2009 06:01

Online Algorithms for Self-Organizing Sequential Search - A Survey



The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List Update Problem(LUP) in a chronological way. The survey includes competitiveness results of deterministic and randomized online algorithms and complexity results of optimal off line algorithms for the list update problem. We also present the results associated with list update with look ahead, list update with locality of reference and other variants of the list update problem. We investigate research issues, explore scope of future work associated with each issue so that future researchers can find it useful to work on.

ISSN 1433-8092 | Imprint