A linear space data structure for orthogonal range reporting and emptiness queries

International Journal of Computational Geometry and Applications

Volumn 19, Issue 1, 2009, Pages 1-15

  Nekrich, Yakov ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Data structures; Dynamic data structures; Orthogonal range reporting

Indexed keywords

EID: 65249148504     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195909002800     Document Type: Article

References (21)

1. A. Andersson, Faster deterministic sorting and searching in linear space, Proc. 37th FOCS (1996), pp. 135-141.
2. A. Andersson and M. Thorup, Tight (er) worst-case bounds on dynamic searching and priority queues, Proc. 32nd STOC (2000), pp. 335-342.
3. L. Arge and J. S. Vitter, Optimal external memory interval management, SIAM J. Comput. 32(6) (2003) 1488-1508.
4. M. A. Bender, R. Cole, E. D. Demaine, M. Farach-Colton and J. Zito, Two simplified algorithms for maintaining order in a list, Proc. 10th ESA (2002), pp. 152-164.
5. M. A. Bender, E. D. Demaine and M. Farach-Colton, Cache-oblivious B-trees, SIAM J. Comput. 35(2) (2005) 341-358.
6. J. L. Bentley, Multidimensional divide-and-conquer, Commun. ACM 23 (1980) 214-229.
7. D. K. Blandford and G. E. Blelloch, Compact representations of ordered sets, Proc. 15th SODA (2004), pp. 11-19.
8. B. Chazelle, A functional approach to data structures and its use in multidimensional searching, SIAM J. Comput. 17 (1988) 427-462.
9. P. F. Dietz and J. Zhang, Lower bounds for monotonic list labeling, Proc. 2nd SWAT (1990), pp. 173-180.
10. P. Elias, Universal codeword sets and representations of the integers, IEEE Trans. Inform. Th. 21 (1975) 194-203.
11. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear-space, Inf. Process. Lett. 6(3) (1977) 80-82.
12. P. van Emde Boas, R. Kaas and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Syst. Th. 10 (1977) 99-127.
13. A. Itai, A. G. Konheim and M. Rodeh, A sparse table implementation of priority queues, Proc. 8th ICALP (1981), pp. 417-431.
14. M. Van Kreveld and M. H. Overmars, Divided K-d trees, Algorithmica 6(6) (1991) 840-858.
15. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching (Springer, 1984).
16. C. W. Mortensen, Fully dynamic orthogonal range reporting on RAM, SIAM J. Comput. 35 (2006) 1494-1525.
17. Y. Nekrich, Space efficient dynamic orthogonal range reporting, Proc. 21st SoCG (2005), pp. 306-313.
18. J. I. Munro, V. Raman and A. J. Storm, Representing dynamic binary trees succinctly, Proc. 12th SODA (2001), pp. 529-536.
19. R. Raman, V. Raman and S. S. Rao, Succinct dynamic data structures, Proc. 7th WADS (2001), pp. 426-437.
20. R. E. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comput. Syst. Sci. 18 (1979) 110-127.
21. D. E. Willard, A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time, Inform. Comput. 97 (1992) 150-204.