External Memory Data Structures-Reference-Cited by-同舟云学术

External Memory Data Structures

Published:2001 Issue: Volume: Page:1-29
ISSN:0302-9743
Container-title:Algorithms — ESA 2001
language:
Short-container-title:

Author:

Arge Lars

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44676-1_1

Reference157 articles.

1. D. J. Abel and D. M. Mark. A comparative analysis of some two-dimensional orderings. Intl. J. Geographic Informations Systems, 4(1):21–31, 1990.

2. Lect Notes Comput Sci;J. Abello,1998

3. P. K. Agarwal, L. Arge, G. S. Brodal, and J. S. Vitter. I/O-efficient dynamic point location in monotone planar subdivisions. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 1116–1127, 1999.

4. P. K. Agarwal, L. Arge, and J. Erickson. Indexing moving points. In Proc. ACM Symp. Principles of Database Systems, pages 175–186, 2000.

5. P. K. Agarwal, L. Arge, J. Erickson, P. Franciosa, and J. Vitter. Efficient searching with linear constraints. Journal of Computer and System Sciences, 61(2):194–216, 2000.

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

1. Analyzing Clustering and Partitioning Problems in Selected VLSI Models;Theory of Computing Systems;2020-08-22

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

3. On the space–time of optimal, approximate and streaming algorithms for synopsis construction problems;The VLDB Journal;2007-12-13

4. Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths;Algorithm Theory - SWAT 2004;2004

5. I/O-Efficient Point Location in a Set of Rectangles;Lecture Notes in Computer Science