General methods for adding range restrictions to decomposable searching problems
- 31 January 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 7 (1) , 1-10
- https://doi.org/10.1016/s0747-7171(89)80002-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Adding range restriction capability to dynamic data structuresJournal of the ACM, 1985
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Decomposable searching problemsInformation Processing Letters, 1979