On Serial Files with Relocatable Records
From MaRDI portal
Publication:5343868
DOI10.1287/opre.13.4.609zbMath0133.40807OpenAlexW2013596337MaRDI QIDQ5343868
Publication date: 1965
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.13.4.609
Related Items (32)
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 ⋮ On the distribution of the search cost for the move-to-front rule with random weights ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ Relative Worst-Order Analysis: A Survey ⋮ List update with probabilistic locality of reference ⋮ A generalized counter scheme ⋮ List factoring and relative worst order analysis ⋮ Optimal strategies for the list update problem under the MRM alternative cost model ⋮ Deterministic optimal and expedient move-to-rear list organizing strategies ⋮ Limiting behavior of the search cost distribution for the move-to-front rule in the stable case ⋮ Stochastic rearrangement rules for self-organizing data structures ⋮ Performance of the move-to-front algorithm with Markov-modulated request sequences ⋮ Limits and rates of convergence for the distribution of search cost under the move-to-front rule ⋮ A new class of libraries ⋮ Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process ⋮ Birthday paradox, coupon collectors, caching algorithms and self- organizing search ⋮ Limiting search cost distribution for the move-to-front rule with random request probabilities ⋮ Stochastic ranking process with time dependent intensities ⋮ Least-recently-used caching with dependent requests ⋮ Second step algorithms in the Burrows-Wheeler compression algorithm ⋮ A dynamic location problem for graphs ⋮ Enhancing the \(B^{+}\)-tree by dynamic node popularity caching ⋮ A fluid limit for a cache algorithm with general request processes ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:3908273 R�currence positive des librairies mixtes] ⋮ On Optimal Performance in Self-Organizing Paging Algorithams ⋮ 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 ⋮ Randomized competitive algorithms for the list update problem ⋮ On lookahead in the list update problem
This page was built for publication: On Serial Files with Relocatable Records
