BACK TO INDEX

Publications about 'PRAM'
Articles in journal, book chapters
  1. Philip N. Klein and Sairam Subramanian. A randomized parallel algorithm for single-source shortest paths. Journal of Algorithms, 25(2):205-220, November 1997. [POSTSCRIPT] Keyword(s): CRCW, PRAM, Single-source shortest paths.


  2. Alok Aggarwal, Richard J. Anderson, and Ming-Yang Kao. Parallel depth-first search in general directed graphs. SIAM Journal on Computing, 19(2):397-409, 1990. ISSN: 0097-5397. [PDF] Keyword(s): Depth-first search, PRAM.


  3. James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11):1343-1354, 1988. ISSN: 0001-0782. [PDF] Keyword(s): Single-source shortest paths, EREW, PRAM.


  4. Hillel Gazit and Gary L. Miller. An improved parallel algorithm that computes the BFS numbering of a directed graph. Information Processing Letters, 28(2):61-65, 1988. ISSN: 0020-0190. [PDF] Keyword(s): Breadth-first search, fast matrix multiplication, parallel algorithm, EREW, PRAM.


Conference articles
  1. Ulrich Meyer. Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. In Rizos Sakellariou, John Keane, John R. Gurd, and Len Freeman, editors, 7th International Euro-Par Conference, volume 2150 of Lecture Notes in Computer Science, pages 343-351, August 2001. Springer. [PDF] Keyword(s): Single-source shortest paths, CRCW, PRAM.


  2. Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders. A Parallelization of Dijkstra's Shortest Path Algorithm. In Lubos Brim, Jozef Gruska, and Jirì Zlatuska, editors, Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 722-731, 1998. Springer. [PDF] Keyword(s): Single-source shortest paths, CRCW, PRAM.


  3. Steve Goddard, Subodh Kumar, and Jan F. Prins. Connected Components Algorithms For Mesh Connected Parallel Computers. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 43-58, 1997. American Mathematical Society. [PDF] Keyword(s): Connected components, CRCW, PRAM.


  4. Tsan-Sheng Hsu, Vijaya Ramachandran, and Nathaniel Dean. Parallel implementation of algorithms for finding connected components in graphs. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 23-42, 1997. American Mathematical Society. [POSTSCRIPT] Keyword(s): Connected components, CRCW, PRAM.


  5. Arvind Krishnamurthy, Steven S. Lumetta, David E. Culler, and Katherine Yelick. Connected components on distributed memory machines. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1-22, 1997. American Mathematical Society. [POSTSCRIPT] Keyword(s): Connected components, PRAM.


  6. John Greiner. A comparison of parallel algorithms for connected components. In Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, pages 16-25, 1994. ACM Press. ISBN: 0-89791-671-9. [PDF] Keyword(s): Connected components, PRAM.


  7. David E. Culler, Richard Karp, David Patterson, Abhijit Sahay, Klaus Erik Schauser, Eunice Santos, Ramesh Subramonian, and Thorsten von Eicken. LogP: towards a realistic model of parallel computation. In Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 1-12, 1993. ACM Press. ISBN: 0-89791-589-5. [PDF] Keyword(s): LogP.


  8. Alok Aggarwal and Richard J. Anderson. A random NC algorithm for depth first search. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 325-334, 1987. ACM Press. ISBN: 0-89791-221-7. [PDF] Keyword(s): Depth-first search, PRAM.



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.




Last modified: Fri Aug 24 15:59:36 2012
Author: ngedmond.


This document was translated from BibTEX by bibtex2html