Pages that link to "Item:Q4178468"
From MaRDI portal
The following pages link to Heuristics That Dynamically Organize Data Structures (Q4178468):
Displayed 24 items.
- Stochastic ranking process with time dependent intensities (Q542907) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule (Q671429) (← links)
- Least-recently-used caching with dependent requests (Q703555) (← links)
- Fair service for mice in the presence of elephants (Q845690) (← links)
- Deterministic optimal and expedient move-to-rear list organizing strategies (Q914378) (← links)
- Stochastic rearrangement rules for self-organizing data structures (Q922688) (← links)
- Self-organizing sequential search and Hilbert's inequalities (Q1104755) (← links)
- On linear search heuristics (Q1114411) (← links)
- An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- A generalized counter scheme (Q1156492) (← links)
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search (Q1201808) (← links)
- The weighted list update problem and the lazy adversary (Q1208728) (← links)
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities (Q1305419) (← links)
- On lookahead in the list update problem (Q1322123) (← links)
- An exact formula for the move-to-front rule for self-organizing lists (Q1908208) (← links)
- Performance of the move-to-front algorithm with Markov-modulated request sequences (Q1962831) (← links)
- Eigenvalues of LRU via a linear algebraic approach (Q2417099) (← links)
- Expected Costs in Some Classes of Binary Search Trees (Q3219127) (← links)
- Amortized Computational Complexity (Q3735083) (← links)
- Self-organizing doubly linked lists<sup>†</sup> (Q3865505) (← links)
- The move-to-root rule for self-organizing trees with Markov dependent requests<sup>∗</sup> (Q4882951) (← links)
- (Q5094003) (← links)