Dynamic Binary Search
- 1 May 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (2), 175-198
- https://doi.org/10.1137/0208014
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A Best Possible Bound for The Weighted Path Length of Binary Search TreesSIAM Journal on Computing, 1977
- Schranken fur balanced trees bei ausgewogenen verteilungenTheoretical Computer Science, 1976
- Binary Search Trees: Average and Worst Case Behavior (Extended Abstract)Published by Springer Nature ,1976
- Nearly optimal binary search treesActa Informatica, 1975
- 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
- Optimal Computer Search Trees and Variable-Length Alphabetical CodesSIAM Journal on Applied Mathematics, 1971
- Optimum binary search treesActa Informatica, 1971
- Randomized binary searching with tree structuresCommunications of the ACM, 1964
- Trie memoryCommunications of the ACM, 1960
- Variable-Length Binary EncodingsBell System Technical Journal, 1959