Algorithms and Data Structures for External Memory
Open Access
- 1 January 2006
- journal article
- research article
- Published by Now Publishers in Foundations and Trends® in Theoretical Computer Science
- Vol. 2 (4), 305-474
- https://doi.org/10.1561/0400000014
Abstract
Publishers of Foundations and Trends, making research accessibleKeywords
This publication has 28 references indexed in Scilit:
- External-Memory Algorithms for Processing Line Segments in Geographic Information SystemsAlgorithmica, 2006
- External selectionJournal of Algorithms, 2006
- On external-memory MST, SSSP and multi-way planar graph separationJournal of Algorithms, 2004
- I/O-efficient dynamic planar point locationComputational Geometry, 2004
- (Almost) Optimal parallel block access for range queriesInformation Sciences, 2003
- Two-dimensional substring indexingJournal of Computer and System Sciences, 2003
- Indexing Moving PointsJournal of Computer and System Sciences, 2003
- Fast Concurrent Access to Parallel DisksAlgorithmica, 2002
- Box-Trees and R-Trees with Near-Optimal Query TimeDiscrete & Computational Geometry, 2002
- Efficient Searching with Linear ConstraintsJournal of Computer and System Sciences, 2000