AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
External Memory Algorithms
About this Title
James M. Abello, AT&T Labs-Research, Florham Park, NJ and Jeffrey Scott Vitter, Duke University, Durham, NC, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1999; Volume 50
ISBNs: 978-0-8218-1184-9 (print); 978-1-4704-4008-4 (online)
DOI: https://doi.org/10.1090/dimacs/050
MathSciNet review: MR1732453
MSC: Primary 68-06; Secondary 00B25, 68P05, 68W10
ReadershipTable of Contents
Front/Back Matter
Chapters
- External memory algorithms and data structures
- Synopsis data structures for massive data sets
- Calculating robust depth measures for large data sets
- Efficient cross-trees for external memory
- Computing on data streams
- On maximum clique problems in very large graphs
- I/O-optimal computation of segment intersections
- On showing lower bounds for external-memory computational geometry problems
- A survey of out-of-core algorithms in numerical linear algebra
- Concrete software libraries
- S(b)-tree library: An efficient way of indexing data
- ASP: Adaptive online parallel disk scheduling
- Efficient schemes for distributing data on parallel memory systems
- External memory techniques for isosurface extraction in scientific visualization
- R-tree retrieval of unstructured volume data for visualization