Searching for "Heuristics That Dynamically Organize Data Structures." – sorted by Relevance.
-
Asymptotic Approximation of the Move-To-Front Search Cost Distribution and Least-Recently-Used Caching Fault Probabilities
- heuristic dynamically organizing data structures have been proposed. Among the proposed algorithms, the most
- Cited by 14 (7 self) – Add To MetaCart
-
Competitive Algorithms for On-line Paging and Graph Coloring
- organize data-structures for representing sorted lists. SIAM Journal on Computing, Vol. 8, pages 82 110
- Add To MetaCart

