BACK TO INDEX

Publications of year 2006
Books and proceedings
  1. Rick Durrett,. Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics). Cambridge University Press, New York, NY, USA, 2006. ISBN: 0521866561.
    @book{Durret:RandomGraph,
    author = {Durrett,, Rick},
    title = {Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics)},
    year = {2006},
    isbn = {0521866561},
    publisher = {Cambridge University Press},
    address = {New York, NY, USA},
    
    }
    


Conference articles
  1. 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.
    @InProceedings{Bader06:BFS-MTA,
    author = {D.A. Bader and K. Madduri},
    title = {Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray {MTA-2}},
    booktitle = {Proceedings of 35th International Conference on Parallel Processing},
    pages = {523--530},
    year = 2006,
    month = {August} 
    }
    


  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]
    @inproceedings{Bader06:centrality,
    author = {David A. Bader and Kamesh Madduri},
    title = {Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks},
    booktitle = {ICPP '06: Proceedings of the 2006 International Conference on Parallel Processing},
    year = {2006},
    isbn = {0-7695-2636-5},
    pages = {539--550},
    doi = {http://dx.doi.org/10.1109/ICPP.2006.57},
    publisher = {IEEE},
    address = {Washington, DC},
    
    }
    


  3. Alex Breuer, Peter Gottschling, Douglas Gregor, and Andrew Lumsdaine. Effecting Parallel Graph Eigensolvers Through Library Composition. In Performance Optimization for High-Level Languages and Libraries (POHLL), April 2006.
    @InProceedings{Breuer06:GraphEigen,
    author = {Alex Breuer and Peter Gottschling and Douglas Gregor and Andrew Lumsdaine},
    title = {Effecting Parallel Graph Eigensolvers Through Library Composition},
    booktitle = {Performance Optimization for High-Level Languages and Libraries (POHLL)},
    year = 2006,
    month = {April} 
    }
    


  4. Nick Edmonds, Alex Breuer, Douglas Gregor, and Andrew Lumsdaine. Single-Source Shortest Paths with the Parallel Boost Graph Library. In The Ninth DIMACS Implementation Challenge: The Shortest Path Problem, Piscataway, NJ, November 2006.
    @InProceedings{edmonds06:dimacs,
    author = {Nick Edmonds and Alex Breuer and Douglas Gregor and Andrew Lumsdaine},
    title = {Single-Source Shortest Paths with the {P}arallel {B}oost {G}raph {L}ibrary},
    booktitle = {The Ninth {DIMACS} Implementation Challenge: The Shortest Path Problem},
    year = 2006,
    address = {Piscataway, NJ},
    month = {November} 
    }
    


  5. John R. Gilbert, Steve Reinhardt, and Viral Shah. High-Performance Graph Algorithms from Parallel Sparse Matrices. In PARA, pages 260-269, 2006.
    @inproceedings{Gilbert06:para,
    author = {John R. Gilbert and Steve Reinhardt and Viral Shah},
    title = {High-Performance Graph Algorithms from Parallel Sparse Matrices},
    booktitle = {PARA},
    year = {2006},
    pages = {260-269},
    
    }
    


Miscellaneous
  1. 9$^ ext{th}$ DIMACS Implementation Challenge - Shortest Paths. rlhttp://www.dis.uniroma1.it/ challenge9/, March 2006.
    @Misc{DIMACS:ShortestPaths,
    title = {9$^	ext{th}$ {DIMACS} {I}mplementation {C}hallenge - {S}hortest {P}aths},
    howpublished = {\url{http://www.dis.uniroma1.it/~challenge9/}},
    month = {March},
    year = 2006 
    }
    


  2. David A. Bader and Kamesh Madduri. GTgraph: A suite of synthetic graph generators. rlhttp://www-static.cc.gatech.edu/ kamesh/GTgraph/, February 2006.
    @Misc{GTgraph,
    author = {David A. Bader and Kamesh Madduri},
    title = {{GTgraph}: A suite of synthetic graph generators},
    howpublished = {\url{http://www-static.cc.gatech.edu/~kamesh/GTgraph/}},
    month = {February},
    year = 2006 
    }
    


  3. Kamesh Madduri, David Bader, Jonathan W. Berry, and Joseph R. Crobak. Parallel Shortest Path Algorithms for Solving Large-Scale Instances. 9$^\text{th}$ DIMACS Implementation Challenge - Shortest Paths, 2006. Note: An updated version of the paper appears in this book.
    @Misc{Bader06:Dimacs,
    author = {Kamesh Madduri and David Bader and Jonathan W. Berry and Joseph R. Crobak},
    title = {Parallel Shortest Path Algorithms for Solving Large-Scale Instances},
    howpublished = {9$^	ext{th}$ {DIMACS} Implementation Challenge - Shortest Paths},
    note = {An updated version of the paper appears in this book},
    year = 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