Heuristics That Dynamically Organize Data Structures

Cited in

(24)

Self-organizing sequential search and Hilbert's inequalities
On linear search heuristics
An on-line graph coloring algorithm with sublinear performance ratio
A competitive analysis of the list update problem with lookahead
A generalized counter scheme
Birthday paradox, coupon collectors, caching algorithms and self- organizing search
The weighted list update problem and the lazy adversary
Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
On lookahead in the list update problem
An exact formula for the move-to-front rule for self-organizing lists
Performance of the move-to-front algorithm with Markov-modulated request sequences
Eigenvalues of LRU via a linear algebraic approach
Expected Costs in Some Classes of Binary Search Trees
Amortized Computational Complexity
Self-organizing doubly linked lists^†
The move-to-root rule for self-organizing trees with Markov dependent requests^∗
Functional central limit theorem for tagged particle dynamics in stochastic ranking process with space-time dependent intensities
Stochastic ranking process with time dependent intensities
A dynamic location problem for graphs
Limits and rates of convergence for the distribution of search cost under the move-to-front rule
Least-recently-used caching with dependent requests
Fair service for mice in the presence of elephants
Deterministic optimal and expedient move-to-rear list organizing strategies
Stochastic rearrangement rules for self-organizing data structures

This page was built for publication: Heuristics That Dynamically Organize Data Structures

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