Self-organizing sequential search and Hilbert's inequalities

DOI10.1016/0022-0000(88)90025-6zbMath0647.68059OpenAlexW4240430811MaRDI QIDQ1104755

D. J. Hajela, P. D. Seymour, Fan R. K. Chung

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

zbMATH Keywords

worst-case boundsaverage timeHilbet's inequalitiesmove-to-front heuristicself-organizing sequential search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Inequalities involving derivatives and differential and integral operators (26D10)

Related Items

Off-line algorithms for the list update problem, Stochastic ranking process with time dependent intensities, A dynamic location problem for graphs, Unnamed Item, Decentralized utilitarian mechanisms for scheduling games, The Application of Restricted Counter Schemes to Three Models of Linear Search, Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities, On lookahead in the list update problem

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal list order under partial memory constraints
• Exegesis of Self-Organizing Linear Search
• A counterexample to a conjecture on optimal list ordering
• On self-organizing sequential search heuristics
• An Account of Self-Organizing Systems
• Heuristics That Dynamically Organize Data Structures
• On a model for storage and search
• On Serial Files with Relocatable Records