DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1999; 306 pp; hardcover Volume: 50 ISBN10: 0821811843 ISBN13: 9780821811849 List Price: US$87 Member Price: US$69.60 Order Code: DIMACS/50
 We are especially proud to announce the publication of this DIMACS bookthe 50th volume in this series, published by the AMS. The series was established out of a collaborative venture geared to unite the cuttingedge research at DIMACS with the resources at the AMS to produce useful, welldesigned, important mathematical and computational sciences works. This volume is a hallmark in this firmly grounded and wellreceived AMS series. The AMS's 50th DIMACS volume is also particularly notable at this time: The year 1999 marks the 10th anniversary of the founding of DIMACS as a center. Participants in the DIMACS national research project are Rutgers University, Princeton University, AT&T LabsResearch, Bell Labs (Lucent Technologies), Telcordia Technologies, and NEC Research Institute. The success of the joint publishing venture between the AMS and DIMACS is excellent. We continue to work concordantly with the Center to further their goal of playing a key national leadership role in the development, application, and dissemination of discrete mathematics and theoretical computer science. This 50th DIMACS volume is in celebration of that dynamic, ongoing partnership. About the book: Special techniques from computer science and mathematics are used to solve combinatorial problems whose associated data require a hierarchy of storage devices. These solutions employ "extended memory algorithms". The input/output (I/O) communication between the levels of the hierarchy is often a significant bottleneck, especially in applications that process massive amounts of data. Gains in performance are possible by incorporating locality directly into the algorithms and managing the contents of each storage level. The relative difference in data access speeds is more apparent between random access memory and magnetic disks. Therefore, much research has been devoted to algorithms that focus on this I/O bottleneck. These algorithms are usually called "external memory", "outofcore", or "I/O algorithms". This volume presents new research results and current techniques for the design and analysis of external memory algorithms. The articles grew out of the workshop, "External Memory Algorithms and Visualization" held at DIMACS. Leading researchers were invited to give lectures and to contribute their work. Topics presented include problems in computational geometry, graph theory, data compression, disk scheduling, linear algebra, statistics, software libraries, text and string processing, visualization, wavelets, and industrial applications. The vitality of the research and the interdisciplinary nature of the event produced fruitful ground for the compelling fusion of ideas and methods. This volume comprises the rich results that grew out of that process. About the editors: James Abello has been facing for several years a daily data avalanche that crosses the Infolab at AT&TShannon Laboratories. He and his colleagues have helped formulate some of the major challenges in real Massive Data Exploration. His encounter with Jeff Vitter has been a fruitful ground where practice and theory have been able to interact with success. Dr. Abello has a Ph.D. in Combinatorial Algorithms from the University of California, San Diego. He was the recipient of a University California President's Postdoctoral Fellowship in Computer Science. His publications include articles in combinatorics, graph theory, discrete and computational geometry, algorithm visualization systems, distributed computing and external memory algorithms. Dr. Abello has been with AT&T Research since 1995 and is currently a member of the Information Visualization Department at Shannon Laboratories, Florham Park, New Jersey. Jeff Vitter is the cocreator of the widely used parallel I/O model and is a leader in the field of external memory algorithms and data structures. He is the Gilbert, Louis, and Edward Lehrman Professor of Computer Science and Chair of the Department of Computer Science at Duke University and CoDirector of the Center for Geometric Computing at Duke. He was previously on the faculty at Brown University. He has been named a Guggenheim Foundation Fellow, a Fellow of the Association for Computing Machinery, a Fellow of the Institute of Electrical and Electronics Engineers, a National Science Foundation Presidential Young Investigator, and a Fulbright Scholar. Professor Vitter works on efficient external memory algorithms in several domains, dealing with geographic information systems, sorting, FFT, matrix computations, graph traversal, range searching, data mining, and a variety of computational geometry and combinatorial problems. A related interest is how to take advantage of parallel disks and parallel hierarchical memories. He is currently doing algorithm engineering using the TPIE system. Other work includes prediction mechanisms for use by systems to improve locality for caching, prefetching, database query optimization, data mining, and resource management in mobile computers. He also works on image, video, and text compression, computational geometry, graphics, random sampling, and random variate generation. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Graduate students, research and applied mathematicians interested in computer science. Table of Contents  J. S. Vitter  External memory algorithms and data structures
 P. B. Gibbons and Y. Matias  Synopsis data structures for massive data sets
 I. AlFuraih, T. Johnson, and S. Ranka  Calculating robust depth measures for large data sets
 R. Grossi and G. F. Italiano  Efficient crosstrees for external memory
 M. R. Henzinger, P. Raghavan, and S. Rajagopalan  Computing on data streams
 J. Abello, P. M. Pardalos, and M. G. C. Resende  On maximum clique problems in very large graphs
 A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, and E. A. Ramos  I/Ooptimal computation of segment intersections
 L. Arge and P. B. Miltersen  On showing lower bounds for externalmemory computational geometry problems
 S. Toledo  A survey of outofcore algorithms in numerical linear algebra
 K.P. Vo  Concrete software libraries
 K. V. Shvachko  S(b)tree library: An efficient way of indexing data
 M. Kallahalla and P. J. Varman  ASP: Adaptive online parallel disk scheduling
 S. K. Das and M. C. Pinotti  Efficient schemes for distributing data on parallel memory systems
 Y.J. Chiang and C. T. Silva  External memory techniques for isosurface extraction in scientific visualization
 S. T. Leutenegger and K.L. Ma  Rtree retrieval of unstructured volume data for visualization
