Abstract is missing.
- Preface
- Foreword
- Connected components on distributed memory machinesArvind Krishnamurthy, Steven S. Lumetta, David E. Culler, Katherine A. Yelick. 1-22
- Parallel implementation of algorithms for finding connected components in graphsTsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean. 23-42
- Connected components algorithms for mesh-connected parallel computersSteve Goddard, Subodh Kumar, Jan F. Prins. 43-58
- Implementing parallel shortest-paths algorithmsMarios C. Papaefthymiou, Joseph Rodrigue. 59-68
- Finding friends-of-friends clusters quicklyBrendan Mumey. 69-80
- A practical comparison of N-body algorithmsGuy E. Blelloch, Girija J. Narlikar. 81-96
- Parallel algorithms for geometric dominance problemsJan Petersson. 97-116
- The *Socrates massively parallel chess programChristopher F. Joerg, Bradley C. Kuszmaul. 117-140
- Concurrent data structures and load balancing strategies for parallel branch-and-bound/A* algorithmsVan-Dat Cung, Salah Dowaji, Bertrand Le Cun, Thierry Mautor, Catherine Roucairol. 141