On self-organizing sequential search heuristics
From MaRDI portal
Publication:4079040
DOI10.1145/359997.360000zbMath0317.68025OpenAlexW2016153661WikidataQ56454125 ScholiaQ56454125MaRDI QIDQ4079040
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
Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
On list update with locality of reference ⋮ Solution structures and sensitivity of special assignment problems ⋮ Comparison of subdominant eigenvalues of some linear search schemes ⋮ Fair service for mice in the presence of elephants ⋮ Off-line algorithms for the list update problem ⋮ Self-organizing sequential search and Hilbert's inequalities ⋮ A Transposition Rule Analysis Based on a Particle Process ⋮ Amortized Computational Complexity ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ On linear search heuristics ⋮ An on-line graph coloring algorithm with sublinear performance ratio ⋮ A competitive analysis of the list update problem with lookahead ⋮ On hash techniques in a paged environment ⋮ List update with probabilistic locality of reference ⋮ A generalized counter scheme ⋮ Deterministic optimal and expedient move-to-rear list organizing strategies ⋮ Unnamed Item ⋮ Leading the field: fortune favors the bold in Thurstonian choice models ⋮ Stochastic rearrangement rules for self-organizing data structures ⋮ A new class of libraries ⋮ Birthday paradox, coupon collectors, caching algorithms and self- organizing search ⋮ The weighted list update problem and the lazy adversary ⋮ Unnamed Item ⋮ Stochastic ranking process with time dependent intensities ⋮ Least-recently-used caching with dependent requests ⋮ A dynamic location problem for graphs ⋮ Unnamed Item ⋮ Comparison of different disk searching methods ⋮ On a generalization of binary search ⋮ On the optimality of the counter-scheme for dynamic linear lists ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:3908273 R�currence positive des librairies mixtes] ⋮ Mixing of permutations by biased transpositions ⋮ On the competitiveness of the move-to-front rule ⋮ The Move-to-Front Rule for Multiple Lists ⋮ The Application of Restricted Counter Schemes to Three Models of Linear Search ⋮ A Survey of Algorithms and Models for List Update ⋮ Multiplicities of eigenvalues of some linear search schemes ⋮ Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities ⋮ MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM ⋮ Randomized competitive algorithms for the list update problem ⋮ On lookahead in the list update problem
