I/O-Efficient Point Location in a Set of Rectangles-Reference-Cited by-同舟云学术

I/O-Efficient Point Location in a Set of Rectangles

Published: Issue: Volume: Page:687-698
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Nekrich Yakov

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-78773-0_59.pdf

Reference24 articles.

1. Agarwal, P.K., Arge, L., Brodal, G.S., Vitter, J.S.: I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. In: Proc. SODA, pp. 11–20 (1999)

2. Agarwal, P.K., Arge, L., Yi, K.: An Optimal Dynamic Interval Stabbing-Max Data Structure? In: Proc. SODA, pp. 803–812 (2005)

3. Aggarwal, A., Vitter, J.S.: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM 31(9), 1116–1127 (1988)

4. Lecture Notes in Computer Science;L. Arge,2001

5. Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S.: Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). In: Proc. SODA, pp. 685–694 (1998)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Top-k Range Reporting in 2D Space;Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2015-05-20

2. Persistent Predecessor Search and Orthogonal Point Location on the Word RAM;ACM Transactions on Algorithms;2013-06

3. Computing Discriminating and Generic Words;String Processing and Information Retrieval;2012

4. External Memory Orthogonal Range Reporting with Fast Updates;Algorithms and Computation;2011

5. Dynamic Range Reporting in External Memory;Algorithms and Computation;2010