Self-organizing data structures with dependent accesses
From MaRDI portal
Recommendations
- Self-organizing files with dependent accesses
- The move-to-root rule for self-organizing trees with Markov dependent requests∗
- scientific article; zbMATH DE number 795110
- Optimality of move-to-front for self-organizing data structures with locality of references
- Stochastic rearrangement rules for self-organizing data structures
Cited in
(12)- Self-organizing sequential search and Hilbert's inequalities
- Optimality of move-to-front for self-organizing data structures with locality of references
- On the Markov chain for the move-to-root rule for binary search trees
- A Markov chain model for dynamic binary search tree behaviour
- Self-organizing files with dependent accesses
- Self-Organizing Heuristics for Implicit Data Structures
- Self-Organizing Doubly-Linked Lists
- HISTORICAL SEARCHING
- scientific article; zbMATH DE number 795110 (Why is no real title available?)
- The move-to-root rule for self-organizing trees with Markov dependent requests∗
- Markov incremental constructions
- Stochastic rearrangement rules for self-organizing data structures
This page was built for publication: Self-organizing data structures with dependent accesses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818863)