Self-organizing files with dependent accesses
From MaRDI portal
Publication:3319769
Recommendations
- scientific article; zbMATH DE number 2102775
- Comparison of self-organizing linear search rules
- scientific article; zbMATH DE number 795110
- The move-to-root rule for self-organizing trees with Markov dependent requests∗
- Performance of the move-to-front algorithm with Markov-modulated request sequences
Cited in
(11)- Stochastic rearrangement rules for self-organizing data structures
- Performance of the move-to-front algorithm with Markov-modulated request sequences
- Self-organizing sequential search and Hilbert's inequalities
- An exact formula for the move-to-front rule for self-organizing lists
- The move-to-root rule for self-organizing trees with Markov dependent requests∗
- Comparison of self-organizing linear search rules
- Markov incremental constructions
- scientific article; zbMATH DE number 2102775 (Why is no real title available?)
- A Transposition Rule Analysis Based on a Particle Process
- A fluid limit for a cache algorithm with general request processes
- Multiplicities of eigenvalues of some linear search schemes
This page was built for publication: Self-organizing files with dependent accesses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3319769)