Orthogonal range searching in linear and almost-linear space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4619 LNCS, Issue , 2007, Pages 15-26

  Nekrich, Yakov ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; LINEAR SYSTEMS; PROBLEM SOLVING; QUERY PROCESSING; TWO DIMENSIONAL;

LINEAR SPACE; ONE-REPORTING QUERIES; OPTIMAL TIME; ORTHOGONAL RANGE SEARCHING;

SEARCH ENGINES;

EID: 38149008242     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_3     Document Type: Conference Paper

References (19)

1. Alstrup, S., Brodal, G.S., Rauhe, T.: New Data Structures for Orthogonal Range Searching. In: Proc. 41st FOCS 2000, pp. 198-207 (2000)
2. Arge, L., Vitter, J.S.: Optimal External Memory Interval Management. SIAM J. on Computing 32(6), 1488-1508 (2003)
3. Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two Simplified Algorithms for Maintaining Order in a List. In: Möhring, R.H., Raman, R. (eds.) Proc. 10th ESA 2002. LNCS, vol. 2461, pp. 152-164. Springer, Heidelberg (2002)
4. Bentley, J.L.: Multidimensional Divide-and-Conquer. Commun. ACM 23, 214-229 (1980)
5. Blandford, D.K., Blelloch, G.E.: Compact Representations of Ordered Sets. In: Proc. 15th SODA 2004, pp. 11-19 (2004)
6. Chazelle, B.: A Functional Approach to Data Structures and its Use in Multidimensional Searching. SIAM J. on Computing 17, 427-462 (1988)
7. Elias, P.: Universal Codeword Sets and Representations of the Integers. IEEE Transactions on Information Theory 21, 194-203 (1975)
8. van Emde Boas, P.: Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space. Inf. Process. Lett. 6(3), 80-82 (1977)
9. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory 10, 99-127 (1977)
10. Itai, A., Konheim, A.G., Rodeh, M.: A Sparse Table Implementation of Priority Queues. In: Even, S., Kariv, O. (eds.) Proc. 8th ICALP 1981. LNCS, vol. 115, pp. 417-431. Springer, Heidelberg (1981)
11. Van Kreveld, M., Overmars, M.H.: Divided K-d Trees. Algorithmica 6(6), 840-858 (1991)
12. Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. Springer, Heidelberg (1984)
13. Mortensen, C.W.: Fully Dynamic Orthogonal Range Reporting on RAM. SIAM J. on Computing 35, 1494-1525 (2006)
14. Nekrich, Y.: Space Efficient Dynamic Orthogonal Range Reporting. In: Proc. 21st SoCG 2005, pp. 306-313 (2005)
15. Nekrich, Y.: A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. In: Proc. 18th CCCG 2006, pp. 159-163 (2006)
16. Mortensen, C.W., Pagh, R., Pǎtrašcu, M.: On Dynamic Range Reporting in One Dimension. In: Proc. 37th STOC 2005, pp. 104-111 (2005)
17. Pǎtrašecu, M.: Lower Bounds for 2-Dimensional Range Counting. In: Proc. 39th STOC 2007 (to appear)
18. Pǎtrašcu, M., Demaine, E.D.: Tight Bounds for the Partial-Sums Problem. In: Proc. 15th SODA 2004, pp. 20-29 (2004)
19. Willard, D.E.: A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time. Information and Computation 97, 150-204 (1992)