Inherent complexity trade-offs for range query problems
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 16 (3) , 279-290
- https://doi.org/10.1016/0304-3975(81)90099-2
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- The Complexity of Maintaining an Array and Computing Its Partial SumsJournal of the ACM, 1982
- Lower Bounds on the Complexity of Some Optimal Data StructuresSIAM Journal on Computing, 1981