External memory algorithms : DIMACS Workshop External Memory Algorithms and Visualization, May 20-22, 1998
James M. Abello, Jeffrey Scott Vitter · American Mathematical Society eBooks · 1999
External memory algorithms and data structures by J. S. Vitter Synopsis data structures for massive data sets by P. B. Gibbons and Y. Matias Calculating robust depth measures for large data sets by I. Al-Furaih, T. Johnson, and S. Ranka Efficient cross-trees for external memory by R. Grossi and G. F. Italiano Computing on data streams by M. R. Henzinger, P. Raghavan, and S. Rajagopalan On maximum clique problems in very large graphs by J. Abello, P. M. Pardalos, and M. G. C. Resende I/O-optimal computation of segment intersections by A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, and E. A. Ramos On showing lower bounds for external-memory computational geometry problems by L. Arge and P. B. Miltersen A survey of out-of-core algorithms in numerical linear algebra by S. Toledo Concrete software libraries by K.-P. Vo S(b)-tree library: An efficient way of indexing data by K. V. Shvachko ASP: Adaptive online parallel disk scheduling by M. Kallahalla and P. J. Varman Efficient schemes for distributing data on parallel memory systems by S. K. Das and M. C. Pinotti External memory techniques for isosurface extraction in scientific visualization by Y.-J. Chiang and C. T. Silva R-tree retrieval of unstructured volume data for visualization by S. T. Leutenegger and K.-L. Ma.