Affiliation:
1. Univ. of California, Irvine
Abstract
Algorithms that modify the order of linear search lists are surveyed. First the problem, including assumptions and restrictions, is defined. Next a summary of analysis techniques and measurements that apply to these algorithms is given. The main portion of the survey presents algorithms in the literature with absolute analyses when available. The following section gives relative measures that are applied between two or more algorithms. The final section presents open questions.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. A counterexample to a conjecture on optimal list ordering;ANDERSON E. J.;J. Appl. Probt.,1982
2. Amortized analyses of self-organizing sequential search heuristics
3. Heuristics that dynamically organize data structures;BITNER J. R.;SIAM J. Comput.,1979
4. On a model for storage and search;BURV LLE;J. AppL Probl.,1973
Cited by
90 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献