Publications about 'distributed algorithm'
Articles in journal, book chapters
  1. Michalis Faloutsos and Mart Molle. A linear-time optimal-message distributed algorithm for minimum spanning trees. Distributed Computing, 17(2):151-170, August 2004. [PDF] Keyword(s): Minimum spanning tree.

  2. Y. H. Tsin. Some remarks on distributed depth-first search. Information Processing Letters, 82(4):173-178, 2002. ISSN: 0020-0190. [PDF] Keyword(s): Analysis of algorithms, Depth-first search, Distributed algorithm, Communication network.

  3. Bala Swaminathan and Kenneth J. Goldman. An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs. Algorithmica, 22(3):305-329, November 1998. [PDF] Keyword(s): Biconnected components.

  4. Ramakrishna Thurimella. Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components. Journal of Algorithms, 23(1):160-189, April 1997. [PDF] Keyword(s): Biconnected components.

  5. S. A. M. Makki and George Havas. Distributed algorithms for depth-first search. Information Processing Letters, 60(1):7-12, 1996. [PDF] Keyword(s): Distributed system, Depth-first search, Distributed algorithm, communication graph.

  6. Devendra Kumar, Sitharama S. Iyengar, and Mohan B. Sharma. Corrections to a distributed depth-first search algorithm. Information Processing Letters, 35(1):55-56, 1990. [PDF] Keyword(s): Distributed system, distributed algorithm, communication graph, Depth-first search.

  7. Mohan B. Sharma, Sitharama S. Iyengar, and Narasimha K. Mandyam. An efficient distributed depth-first-search algorithm. Information Processing Letters, 32(4):183-186, 1989. [PDF] Keyword(s): Depth-first search, Distributed system, distributed algorithm, communication graph.

  8. Isreal Cidon. Yet another distributed depth-first-search algorithm. Information Processing Letters, 26(6):301-305, 1988. [PDF] Keyword(s): Distributed system, distributed algorithm, asynchronous, depth-first-search.

  9. K. B. Lakshmanan, N. Meenakshi, and K. Thulasiraman. A time-optimal message-efficient distributed algorithm for depth-first-search. Information Processing Letters, 25(2):103-109, 1987. [PDF] Keyword(s): Depth-first search.

Conference articles
  1. Ramakrishna Thurimella. Sub-linear distributed algorithms for sparse certificates and biconnected components. In PODC '95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, New York, NY, USA, pages 28-37, 1995. ACM Press. Note: Use the complete journal version of this arcticle, ThurimellaBiconnected97. ISBN: 0-89791-710-3. [PDF] [doi:] Keyword(s): Biconnected components.



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