default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Parallel Algorithms 1994
- Sandeep Nautam Bhatt:
Parallel Algorithms, Proceedings of a DIMACS Workshop, Brunswick, New Jersey, USA, October 17-18, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 30, DIMACS/AMS 1994, ISBN 978-0-8218-0447-6 - Foreword. Parallel Algorithms 1994: ix-
- Preface. Parallel Algorithms 1994: xi-
- Arvind Krishnamurthy, Steven S. Lumetta, David E. Culler, Katherine A. Yelick:
Connected components on distributed memory machines. 1-21 - Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean:
Parallel implementation of algorithms for finding connected components in graphs. 23-41 - Steve Goddard, Subodh Kumar, Jan F. Prins:
Connected components algorithms for mesh-connected parallel computers. 43-58 - Marios C. Papaefthymiou, Joseph Rodrigue:
Implementing parallel shortest-paths algorithms. 59-68 - Brendan Mumey:
Finding friends-of-friends clusters quickly. 69-79 - Guy E. Blelloch, Girija J. Narlikar:
A practical comparison of N-body algorithms. 81-96 - Jan Petersson:
Parallel algorithms for geometric dominance problems. 97-115 - Christopher F. Joerg, Bradley C. Kuszmaul:
The *Socrates massively parallel chess program. 117-140 - Van-Dat Cung, Salah Dowaji, Bertrand Le Cun, Thierry Mautor, Catherine Roucairol:
Concurrent data structures and load balancing strategies for parallel branch-and-bound/A* algorithms. 141-162
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-09 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
