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

(43)

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

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)