External Memory Algorithms

Contents

• External memory algorithms and data structures
  JEFFREY SCOTT VITTER
• Synopsis data structures for massive -data sets
  PHILLIP B. GIBBONS AND YOSSI MATIAS
• Calculating robust depth measures for large data sets
  IBRAHEEM AL-FURAIH, THEODORE JOHNSON, AND SANJAY RANKA
• Efficient crosstrees for external memory
  ROBERTO GROSSI AND GIUSEPPE F. ITALIANO
• Computing on data streams
  MONIKA R. HENZINGER, PRABHAKAR RAGHAVAN, AND SRIDHAR RAJAGOPALAN
• On maximum clique problems in very large graphs
  J. ABELLO, P. PARDALOS, AND M. G. C. RESENDE
• I/0-optimal computation of segment intersections
  A. CRAUSER, P. FERRAGINA, K. MEHLHORN, U. MEYER, AND E. A. RAMOS
• On showing lower bounds for external-memory computational geometry problems
  LARS ARGE AND PETER BRO MILTERSEN
• A survey of out-of-core algorithms in numerical linear algebra
  SIVAN TOLEDO
• Concrete software libraries
  KIEM-PHONG VO
• S(b)-tree library: An efficient way of indexing data
  KONSTANTIN V. SHVACHKO
• ASP: Adaptive online parallel disk scheduling
  MAHESH KALLAHALLA AND PETER J. VARMAN
• Efficient schemes for distributing data on parallel memory systems
  SAJAL K. DAS AND M.CRISTINA PINOTTI
• External memory techniques for isosurface extraction in scientific visualization
  YI-JEN CHIANG AND CLAUDIO T.SILVA
• R-tree retrieval of unstructured volume data for visualization
  SCOTT T. LEUTENEGGER AND KWAN-LIU MA