Lower Bounds on the Complexity of Some Optimal Data Structures
- 1 February 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (1) , 1-10
- https://doi.org/10.1137/0210001
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- The Complexity of Maintaining an Array and Computing Its Partial SumsJournal of the ACM, 1982
- A Lower Bound on the Complexity of Orthogonal Range QueriesJournal of the ACM, 1981
- Decomposable searching problemsInformation Processing Letters, 1979