Two general methods for dynamizing decomposable searching problems
- 1 June 1981
- journal article
- Published by Springer Nature in Computing
- Vol. 26 (2), 155-166
- https://doi.org/10.1007/bf02241781
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Dynamization of decomposable searching problemsInformation Processing Letters, 1980
- Transforming static data structures to dynamic structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Decomposable searching problemsInformation Processing Letters, 1979
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974