Self-organizing sequential search and Hilbert's inequalities
From MaRDI portal
Publication:1104755
DOI10.1016/0022-0000(88)90025-6zbMath0647.68059MaRDI QIDQ1104755
P. D. Seymour, Fan R. K. Chung, D. J. Hajela
Publication date: 1988
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(88)90025-6
worst-case bounds; average time; Hilbet's inequalities; move-to-front heuristic; self-organizing sequential search
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
26D10: Inequalities involving derivatives and differential and integral operators
Related Items
Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities, On lookahead in the list update problem, Off-line algorithms for the list update problem