Optimal static range reporting in one dimension

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 476-482

  Alstrup, Stephen ^a   Brodal, Gerth ^b   Rauhe, Theis ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; MATHEMATICAL MODELS; MEMBERSHIP FUNCTIONS; SET THEORY; THEOREM PROVING;

RANGE COUNTING QUERIES;

DATA STRUCTURES;

EID: 0034832436     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380842     Document Type: Conference Paper

References (25)

1. Range searching
2. The input/output complexity of sorting and related problems
3. A lower bound for finding predecessors in Yao's cell probe model
4. Efficient regular data structures and algorithms for location and proximity problems
5. Sorting in linear time?
6. Approximate indexed lists
7. Tight(er) worst-case bounds on dynamic searching and priority queues
8. Optimal bounds for the predecessor problem
9. An algorithm for approximate closest-point queries
10. Universal hashing and k-wise independent random variables via integer arithmetic without primes
11. Algorithm 245: Treesort3
12. Storing a sparse table with O(1) worst case access time
13. Surpassing the information theoretic bound with fusion trees
14. Trans-dichotomous algorithms for minimum spanning trees and shortest paths
15. Fast algorithms for finding nearest common ancestors
16. Two results on tables
17. Approximate data structures with applications
18. On data structures and asymmetric communication complexity
19. The spatial complexity of oblivious k-probe hash functions
20. Randomized search trees
21. Faster deterministic sorting and priority queues in linear space
22. Log-logarithmic worst-case range queries are possible in space Θ(N)
23. Algorithm 232: Heapsort