BACK TO INDEX

Publications of year 1998
Articles in journal, book chapters
  1. George Karypis and Vipin Kumar. Multilevel k-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 1998. [WWW]


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


  3. Duncan Watts and Steven Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998. [PDF]


Conference articles
  1. Micah Adler, Wolfgang Dittrich, Ben Juurlink, Mirosław Kutyłowski, and Ingo Rieping. Communication-optimal parallel minimum spanning tree algorithms. In Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, pages 27-36, 1998. ACM Press. ISBN: 0-89791-989-0. [PDF] Keyword(s): Minimum spanning tree.


  2. Noga Alon, Michael Krivelevich, and Benny Sudakov. Finding a large hidden clique in a random graph. In SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pages 594-598, 1998. Society for Industrial and Applied Mathematics. ISBN: 0-89871-410-9.


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


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


  5. Afonso Ferreira, Isabelle Guerin Lassous, K. Marcus, and Andrew Rau-Chaplin. Parallel Computation on Interval Graphs Using PC Clusters: Algorithms and Experiments. In European Conference on Parallel Processing, pages 875-886, 1998. [POSTSCRIPT] Keyword(s): Interval graph, Connected components, Maximum Weighted Clique, Breadth-first Search, Depth-first Search, CGM.


  6. Ulrich Meyer and Peter Sanders. Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. In Proceedings of the 6th Annual European Symposium on Algorithms, pages 393-404, 1998. Springer-Verlag. ISBN: 3-540-64848-8.


  7. L. Rauchwerger, F. Arzu, and K. Ouchi. Standard Templates Adaptive Parallel Library. In Wkshp. on Lang. Comp. and Run-time Sys. for Scal. Comp. (LCR), volume 1511 of LNCS, pages 402-410, May 1998. [PDF] Keyword(s): STAPL.


  8. Todd L. Veldhuizen and Dennis Gannon. Active Libraries: Rethinking the roles of compilers and libraries. In Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing, 1998. SIAM Press.


Internal reports
  1. Michelle Hribar, Valerie Taylor, and David E. Boyce. Parallel Shortest Path Algorithms: Identifying the Factors that Affect Performance. Technical report CPDC-TR-9803-015, Center for Parallel and Distributed Computing, Northwestern University, January 1998. [POSTSCRIPT] Keyword(s): Single-source shortest paths.


  2. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project, November 1998. [PDF] Keyword(s): PageRank.



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:34 2012
Author: ngedmond.


This document was translated from BibTEX by bibtex2html