UID:
almahu_9949218781502882
Format:
1 online resource (xi, 306 p. : ill.)
Edition:
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
ISBN:
9781470440084 (online)
Series Statement:
DIMACS Series in Discrete Mathematics and Theoretical Computer Science, v. 50
Note:
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
,
Mode of access : World Wide Web
Additional Edition:
Print version: External memory algorithms : ISSN 1052-1798 ISBN 9780821811849
Language:
English
Bookmarklink
