On self-organizing sequential search heuristics

DOI10.1145/359997.360000zbMATH Open0317.68025DBLPjournals/cacm/Rivest76OpenAlexW2016153661WikidataQ56454125 ScholiaQ56454125MaRDI QIDQ4079040FDOQ4079040

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)

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
Comparison of subdominant eigenvalues of some linear search schemes
On list update with locality of reference
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
Title not available (Why is that?)
Self-organizing sequential search and Hilbert's inequalities
R�currence positive des librairies mixtes
A dynamic location problem for graphs
The weighted list update problem and the lazy adversary
Stochastic rearrangement rules for self-organizing data structures
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
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
Title not available (Why is that?)
MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM
Leading the field: fortune favors the bold in Thurstonian choice models
Title not available (Why is that?)
Amortized Computational Complexity
Stochastic ranking process with time dependent intensities

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)