Amortized Bounds for Dynamic Orthogonal Range Reporting
Author:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 842-856
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Dynamic ordered sets with exponential search treesJournal of the ACM, 2007
- Two Simplified Algorithms for Maintaining Order in a List2002
- On two-dimensional indexability and optimal range search indexing1999
- Marked Ancestor ProblemsBRICS Report Series, 1998
- BLASTING through the information theoretic barrier with FUSION TREES1990
- Two algorithms for maintaining order in a list1987
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- A sparse table implementation of priority queues1981
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977