Heuristics That Dynamically Organize Data Structures
From MaRDI portal
Publication:4178468
DOI10.1137/0208007zbMath0395.68022OpenAlexW2044931094MaRDI QIDQ4178468
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0208007
Related Items (24)
Fair service for mice in the presence of elephants ⋮ Self-organizing sequential search and Hilbert's inequalities ⋮ 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 ⋮ Expected Costs in Some Classes of Binary Search Trees ⋮ Eigenvalues of LRU via a linear algebraic approach ⋮ A generalized counter scheme ⋮ Deterministic optimal and expedient move-to-rear list organizing strategies ⋮ Stochastic rearrangement rules for self-organizing data structures ⋮ Performance of the move-to-front algorithm with Markov-modulated request sequences ⋮ The move-to-root rule for self-organizing trees with Markov dependent requests∗ ⋮ Limits and rates of convergence for the distribution of search cost under the move-to-front rule ⋮ Birthday paradox, coupon collectors, caching algorithms and self- organizing search ⋮ The weighted list update problem and the lazy adversary ⋮ Stochastic ranking process with time dependent intensities ⋮ Least-recently-used caching with dependent requests ⋮ Self-organizing doubly linked lists† ⋮ A dynamic location problem for graphs ⋮ Unnamed Item ⋮ Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities ⋮ On lookahead in the list update problem
This page was built for publication: Heuristics That Dynamically Organize Data Structures
