DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1997; 162 pp; hardcover Volume: 30 ISBN10: 0821804472 ISBN13: 9780821804476 List Price: US$54 Member Price: US$43.20 Order Code: DIMACS/30
 This volume is the result of the Third DIMACS Implementation Challenge that was conducted as part of the 19931994 Special Year on Parallel Algorithms. The Implementation Challenge was formulated in order to provide a forum for a concerted effort to study effective algorithms for combinatorial problems and to investigate opportunities for massive speedups on parallel computers. The challenge included two problem areas for research study: tree searching algorithms, used in game search and combinatorial optimization, for example, and algorithms for sparse graphs. Participants at sites in the U.S. and Europe undertook projects from November 1993 through October 1994. The workshop was held at DIMACS in November 1994. Participants were encouraged to share test results, to rework their implementations considering feedback at the workshop, and to submit a final report for the proceedings. Nine papers were selected for this volume. 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 and research mathematicians interested in computer science. Table of Contents  A. Krishnamurthy, S. S. Lumetta, D. E. Culler, and K. Yelick  Connected components on distributed memory machines
 T.S. Hsu, V. Ramachandran, and N. Dean  Parallel implementation of algorithms for finding connected components in graphs
 S. Goddard, S. Kumar, and J. F. Prins  Connected components algorithms for meshconnected parallel computers
 M. Papaefthymiou and J. Rodrigue  Implementing parallel shortestpaths algorithms
 B. Mumey  Finding friendsoffriends clusters quickly
 G. Blelloch and G. Narlikar  A practical comparison of \(N\)body algorithms
 J. Petersson  Parallel algorithms for geometric dominance problems
 C. F. Joerg and B. C. Kuszmaul  The \(\star\)Socrates massively parallel chess program
 V.D. Cung, S. Dowaji, B. LeCun, T. Mautor, and C. Roucairol  Concurrent data structures and load balancing strategies for parallel branchandbound/A\(^\ast\) algorithms
