BACK TO INDEX

Publications of David A. Bader
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. D.A. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating betweenness centrality. In Algorithms and Models for the Web-Graph, volume 4863 of Lecture Notes in Computer Science, pages 124-137, 2007. Springer-Verlag.


  3. K. Madduri, D.A. Bader, J.W. Berry, and J.R. Crobak. An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances. In Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, January 2007.


  4. D.A. Bader and K. Madduri. Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2. In Proceedings of 35th International Conference on Parallel Processing, pages 523-530, August 2006.


  5. 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]


  6. Guojing Cong and David A. Bader. An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs). In 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05), 2005. [PDF] Keyword(s): Biconnected components.


Internal reports
  1. D A Bader and K Madduri. Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors.. Technical report, 2005.


  2. D.A. Bader, G. Cong, and J. Feo. A comparison of the performance of list ranking and connected components algorithms on SMP and MTA shared-memory systems. Technical report, October 2004.


Manuals, booklets
  1. David A. Bader and others. HPC Scalable Graph Analysis Benchmark. 1.0 edition, September 2009. Note: Rlhttp://www.graphanalysis.org/benchmark/GraphAnalysisBenchmark-v1.0.pdf.


Miscellaneous
  1. David A. Bader and Kamesh Madduri. GTgraph: A suite of synthetic graph generators. rlhttp://www-static.cc.gatech.edu/ kamesh/GTgraph/, February 2006.



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


This document was translated from BibTEX by bibtex2html