BACK TO INDEX

Publications about 'parallel algorithm'
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. 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. K. Madduri, D. Ediger, K. Jiang, D.A. Bader, and D. Chavarria-Miranda. A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets. In Proc. 3rd Workshop on Multithreaded Architectures and Applications (MTAAP 2009), May 2009. IEEE Computer Society. [doi:http://dx.doi.org/10.1109/IPDPS.2009.5161100]


  2. David A. Bader and Kamesh Madduri. Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks. In ICPP '06: Proceedings of the 2006 International Conference on Parallel Processing, Washington, DC, pages 539-550, 2006. IEEE. ISBN: 0-7695-2636-5. [doi:http://dx.doi.org/10.1109/ICPP.2006.57]


  3. Qiaofeng Yang and Stefano Lonardi. A Parallel Algorithm for Clustering Protein-Protein Interaction Networks. In CSBW '05: Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference - Workshops, Washington, DC, USA, pages 174-177, 2005. IEEE Computer Society. ISBN: 0-7695-2442-7. [doi:http://dx.doi.org/10.1109/CSBW.2005.13]


  4. Lubos Brim, Ivana Cerná, and Lukás Hejtmánek. Parallel Algorithms for Detection of Negative Cycles. In PARCO, 2003. [PDF] Keyword(s): Single-source shortest paths.


  5. Libor Bus and Pavel Tvrdìk. A Parallel Algorithm for Connected Components on Distributed Memory Machines. In Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface, pages 280-287, 2001. Springer-Verlag. ISBN: 3-540-42609-4. [PDF] Keyword(s): CGM, Connected components.


  6. Frank Dehne and Silvia Götz. Practical Parallel Algorithms for Minimum Spanning Trees. In Symposium on Reliable Distributed Systems, pages 366-371, 1998. [PDF] Keyword(s): Minimum spanning tree.


  7. Armin Bäumker and Wolfgang Dittrich. Parallel Algorithms for Image Processing: Practical Algorithms with Experiments. In 10th International Parallel Processing Symposium (IPPS '96), pages 429-433, April 1996. Keyword(s): Mesh graph, Connected components, BSP.


  8. 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.


  9. 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.


  10. Donald B. Johnson and Panagiotis Takis Metaxas. A Parallel Algorithm for Computing Minimum Spanning Trees. In ACM Symposium on Parallel Algorithms and Architectures, pages 363-372, 1992.


  11. Kien A. Hua and Sridhar S. Hannenhalli. Parallel transitive closure computations using topological sort. In Proceedings of the first international conference on Parallel and distributed information systems, pages 122-129, 1991. IEEE Computer Society Press. ISBN: 0-8186-2295-4. Keyword(s): Transitive closure, Topological sort.


  12. Vipin Kumar and Vineet Singh. Scalability of parallel algorithms for the all-pairs shortest path problem. In Proceedings of the International Conference on Parallel Processing, pages 124-138, 1991.



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