On Serial Files with Relocatable Records
From MaRDI portal
Cited in
(33)- Self-organizing sequential search and Hilbert's inequalities
- A generalized counter scheme
- A new class of libraries
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- 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
- Off-line algorithms for the list update problem
- Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process
- An exact formula for the move-to-front rule for self-organizing lists
- List factoring and relative worst order analysis
- Performance of the move-to-front algorithm with Markov-modulated request sequences
- Limiting search cost distribution for the move-to-front rule with random request probabilities
- Second step algorithms in the Burrows-Wheeler compression algorithm
- A Survey of Algorithms and Models for List Update
- A fluid limit for a cache algorithm with general request processes
- R�currence positive des librairies mixtes
- On Optimal Performance in Self-Organizing Paging Algorithams
- List update with probabilistic locality of reference
- Optimal strategies for the list update problem under the MRM alternative cost model
- On the distribution of the search cost for the move-to-front rule with random weights
- Stochastic ranking process with time dependent intensities
- A dynamic location problem for graphs
- Relative Worst-Order Analysis: A Survey
- Limiting behavior of the search cost distribution for the move-to-front rule in the stable case
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule
- Least-recently-used caching with dependent requests
- Near-Exact Computation of Independent Chip Model Placement Probabilities for Thousands of Players
- 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
- Enhancing the \(B^{+}\)-tree by dynamic node popularity caching
This page was built for publication: On Serial Files with Relocatable Records
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5343868)
