On self-organizing sequential search heuristics

DOI10.1145/359997.360000MaRDI QIDQ4079040zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ronald L. Rivest

Publication date 1976

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359997.360000

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(42)

• A generalized counter scheme
• The weighted list update problem and the lazy adversary
• On list update with locality of reference
• A new class of libraries
• Stochastic rearrangement rules for self-organizing data structures
• Randomized competitive algorithms for the list update problem
• A Survey of Algorithms and Models for List Update
• MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM
• Deterministic optimal and expedient move-to-rear list organizing strategies
• Self-organizing sequential search and Hilbert's inequalities
• Solution structures and sensitivity of special assignment problems
• Functional central limit theorem for tagged particle dynamics in stochastic ranking process with space-time dependent intensities
• On lookahead in the list update problem
• On the optimality of the counter-scheme for dynamic linear lists
• An exact formula for the move-to-front rule for self-organizing lists
• List update with probabilistic locality of reference
• Mixing of permutations by biased transpositions
• R�currence positive des librairies mixtes
• Defending hash tables from algorithmic complexity attacks with resource burning
• Least-recently-used caching with dependent requests
• Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
• On hash techniques in a paged environment
• On linear search heuristics
• On the competitiveness of the move-to-front rule
• On a generalization of binary search
• Off-line algorithms for the list update problem
• A Transposition Rule Analysis Based on a Particle Process
• Leading the field: fortune favors the bold in Thurstonian choice models
• Comparison of different disk searching methods
• The Application of Restricted Counter Schemes to Three Models of Linear Search
• Multiplicities of eigenvalues of some linear search schemes
• An on-line graph coloring algorithm with sublinear performance ratio
• Fair service for mice in the presence of elephants
• scientific article; zbMATH DE number 3787795 (Why is no real title available?)
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Amortized Computational Complexity
• Stochastic ranking process with time dependent intensities
• scientific article; zbMATH DE number 7758305 (Why is no real title available?)
• The Move-to-Front Rule for Multiple Lists
• A competitive analysis of the list update problem with lookahead
• A dynamic location problem for graphs
• Comparison of subdominant eigenvalues of some linear search schemes

This page was built for publication: On self-organizing sequential search heuristics

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