Exegesis of Self-Organizing Linear Search

DOI10.1137/0210046MaRDI QIDQ3911408zbMATH OpenOpenAlexFDO

Authors Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda

Publication date 1981

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0210046

zbMATH Keywords

asymptotic analysiscomplexity analysisself organizing files

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cited in

(11)

• Self-organizing sequential search and Hilbert's inequalities
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Multiplicities of eigenvalues of some linear search schemes
• On lookahead in the list update problem
• On the competitiveness of the move-to-front rule
• An exact formula for the move-to-front rule for self-organizing lists
• Decentralized utilitarian mechanisms for scheduling games
• List update with probabilistic locality of reference
• An optimal absorbing list organization strategy with constant memory requirements
• Deterministic optimal and expedient move-to-rear list organizing strategies
• Stochastic rearrangement rules for self-organizing data structures

This page was built for publication: Exegesis of Self-Organizing Linear Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3911408)