Heuristics That Dynamically Organize Data Structures
- 1 February 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (1), 82-110
- https://doi.org/10.1137/0208007
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- On self-organizing sequential search heuristicsCommunications of the ACM, 1976
- Nearly optimal binary search treesActa Informatica, 1975
- An extension of a theorem concerning an interesting Markov chainJournal of Applied Probability, 1973
- On a model for storage and searchJournal of Applied Probability, 1973
- The stationary distribution of an interesting Markov chainJournal of Applied Probability, 1972
- A TOP-DOWN ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL LEXICOGRAPHIC TREES††This research was supported in part by the National Research Council of Canada.Published by Elsevier ,1972
- On Serial Files with Relocatable RecordsOperations Research, 1965
- AlgorithmsCommunications of the ACM, 1964
- Some Combinatorial Properties of Certain Trees With Applications to Searching and SortingJournal of the ACM, 1962