BACK TO INDEX

Publications of year 2001
Books and proceedings
  1. B. Bollobas. Random Graphs. Cambridge University Press, 2001. 
    @book{Bollobas01:random_graphs,
author = {B. Bollobas},
editor = {W. Fulton and A. Katok and F. Kirwan and P. Sarnak and B. Simon and B. Totaro},
publisher = {Cambridge University Press},
title = {Random Graphs},
year = 2001,

}


Articles in journal, book chapters
  1. Ulrik Brandes. A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology, 25(2):163-177, 2001. 
    @Article{brandes01:_mathsoc,
author = {Ulrik Brandes},
title = {A Faster Algorithm for Betweenness Centrality},
journal = {Journal of Mathematical Sociology},
year = 2001,
volume = 25,
number = 2,
pages = {163--177} 
}


Conference articles
  1. P. An, A. Jula, S. Rus, S. Saunders, T. Smith, G. Tanase, N. Thomas, N. Amato, and L. Rauchwerger. STAPL: A Standard Template Adaptive Parallel C++ Library. In International Workshop on Advanced Compiler Technology for High Performance and Embedded Processors, pages 10, July 2001. [PDF] Keyword(s): STAPL. 
    @InProceedings{AnSTAPL01a,
author = {P. An and A. Jula and S. Rus and S. Saunders and T. Smith and G. Tanase and N. Thomas and N. Amato and L. Rauchwerger},
title = {{STAPL}: A Standard Template Adaptive Parallel {C++} Library},
booktitle = {International Workshop on Advanced Compiler Technology for High Performance and Embedded Processors},
pages = 10,
year = 2001,
month = {July},
keywords = {STAPL},
pdf = {PAPERS/AnSTAPL01a.pdf} 
}


  2. Ping An, Alin Jula, Silvius Rus, Steven Saunders, Tim Smith, Gabriel Tanase, Nathan Thomas, Nancy Amato, and Lawrence Rauchwerger. STAPL: An Adaptive, Generic Parallel Programming Library for C++. In Workshop on Languages and Compilers for Parallel Computing, pages 193-208, August 2001. [PDF] Keyword(s): STAPL. 
    @InProceedings{AnSTAPL01b,
author = {Ping An and Alin Jula and Silvius Rus and Steven Saunders and Tim Smith and Gabriel Tanase and Nathan Thomas and Nancy Amato and Lawrence Rauchwerger},
title = {{STAPL}: An Adaptive, Generic Parallel Programming Library for {C++}},
booktitle = {Workshop on Languages and Compilers for Parallel Computing},
pages = {193--208},
year = 2001,
month = {August},
keywords = {STAPL},
pdf = {PAPERS/AnSTAPL01b.pdf} 
}


  3. L. Brim, I. Cerná, P. Krcál, and R. Pelánek. How to Employ Reverse Search in Distributed Single-Source Shortest Paths. In L. Pacholski and P. Ruziccka, editors, SOFSEM'01, number 2234 of Lecture Notes in Computer Science, pages 191-200, 2001. Springer Verlag. [PDF] Keyword(s): Single-source shortest paths. 
    @InProceedings{BrimCernaKrcalSSSP01,
author = {L. Brim and I. \v{C}ern\'{a} and P. Kr\v{c}\'{a}l and R. Pel\'{a}nek},
title = {How to Employ Reverse Search in Distributed Single-Source Shortest Paths},
booktitle = {SOFSEM'01},
pages = {191--200},
year = {2001},
editor = {L. Pacholski and P. Ru\v{z}i\v{c}cka},
number = {2234},
series = {Lecture Notes in Computer Science},
publisher = {Springer Verlag},
keywords = {Single-source shortest paths},
pdf = {PAPERS/BrimCernaKrcalSSSP01.pdf} 
}


  4. 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. 
    @InProceedings{BusTvrdikConnectedComponents01,
author = {Libor Bu\v{s} and Pavel Tvrd\'ik},
title = {A Parallel Algorithm for Connected Components on Distributed Memory Machines},
booktitle = {Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface},
year = {2001},
isbn = {3-540-42609-4},
pages = {280--287},
publisher = {Springer-Verlag},
pdf = {PAPERS/BusTvrdikConnectedComponents01.pdf},
keywords = {CGM, Connected components} 
}


  5. E.N. Cáceres, S.W. Song, and J.L. Szwarcfiter. A Parallel Unrestricted Depth Search Algorithm. In Proc. 2001 International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. 1, pages 521-526, June 2001. [PDF] Keyword(s): Unrestricted depth search, CGM, BSP. 
    @InProceedings{CaceresSongSzwarcfiterUDS01,
author = {E.N. C\'aceres and S.W. Song and J.L. Szwarcfiter},
title = {A Parallel Unrestricted Depth Search Algorithm},
booktitle = {Proc. 2001 International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. 1},
pages = {521--526},
year = 2001,
month = {June},
keywords = {Unrestricted depth search, CGM, BSP},
pdf = {PAPERS/CaceresSongSzwarcfiterUDS01.pdf} 
}


  6. Chris H. Q. Ding, Xiaofeng He, and Hongyuan Zha. A spectral method to separate disconnected and nearly-disconnected web graph components. In KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, pages 275-280, 2001. ACM Press. ISBN: 1-58113-391-X. [doi:http://doi.acm.org/10.1145/502512.502551] 
    @inproceedings{502551,
author = {Chris H. Q. Ding and Xiaofeng He and Hongyuan Zha},
title = {A spectral method to separate disconnected and nearly-disconnected web graph components},
booktitle = {KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining},
year = {2001},
isbn = {1-58113-391-X},
pages = {275--280},
location = {San Francisco, California},
doi = {http://doi.acm.org/10.1145/502512.502551},
publisher = {ACM Press},
address = {New York, NY, USA},

}


  7. David Eppstein, and Joseph Wang,. Fast approximation of centrality. In SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pages 228-229, 2001. Society for Industrial and Applied Mathematics. ISBN: 0-89871-490-7. 
    @inproceedings{Eppstein01,
author = {Eppstein,, David and Wang,, Joseph},
title = {Fast approximation of centrality},
booktitle = {SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms},
year = {2001},
isbn = {0-89871-490-7},
pages = {228--229},
location = {Washington, D.C., United States},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},

}


  8. A.V. Goldberg. Shortest Path Algorithms: Engineering Aspects. In Proceedings of 12th International Symposium, ISAAC, pages 502-512, 2001. Springer. 
    @InProceedings{Goldberg01:MLB,
author = {A.V. Goldberg},
title = {Shortest Path Algorithms: Engineering Aspects},
booktitle = {Proceedings of 12th International Symposium, ISAAC},
publisher = {Springer},
pages = {502-512},
year = 2001 
}


  9. William C. McLendon III, Bruce Hendrickson, Steve Plimpton, and Lawrence Rauchwerger. Identifying strongly connected components in parallel. In Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, March 2001. [POSTSCRIPT] Keyword(s): Strongly connected components, STAPL. 
    @InProceedings{ McLendonHendricksonPlimptonSCC01,
author = " William C. {McLendon III} and Bruce Hendrickson and Steve Plimpton and Lawrence Rauchwerger",
title = "Identifying strongly connected components in parallel",
booktitle = "Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing",
month = "March",
year = "2001",
ps = "PAPERS/McLendonHendricksonPlimptonSCC01.ps",
keywords = {Strongly connected components, STAPL} 
}


  10. Ulrich Meyer. Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. In Rizos Sakellariou, John Keane, John R. Gurd, and Len Freeman, editors, 7th International Euro-Par Conference, volume 2150 of Lecture Notes in Computer Science, pages 343-351, August 2001. Springer. [PDF] Keyword(s): Single-source shortest paths, CRCW, PRAM. 
    @InProceedings{MeyerSSSP01,
author = {Ulrich Meyer},
title = {Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs},
booktitle = {7th International Euro-Par Conference},
pages = {343--351},
year = 2001,
editor = {Rizos Sakellariou and John Keane and John R. Gurd and Len Freeman},
volume = 2150,
series = {Lecture Notes in Computer Science},
month = {August},
publisher = {Springer},
keywords = {Single-source shortest paths, CRCW, PRAM},
pdf = {PAPERS/MeyerSSSP01.pdf} 
}


  11. Aris Pagourtzis, Igor Potapov, and Wojciech Rytter. PVM Computation of the Transitive Closure: The Dependency Graph Approach. In Yannis Cotronis and Jack Dongarra, editors, Recent Advances in Parallel Virtual Machine and Message Passing Interface, 8th European PVM/MPI Users' Group Meeting, volume 2131 of Lecture Notes in Computer Science, pages 249-256, September 2001. Springer. [PDF] Keyword(s): Transitive closure, PVM. 
    @InProceedings{PagourtzisPotapovRytterTC01,
author = {Aris Pagourtzis and Igor Potapov and Wojciech Rytter},
title = {{PVM} Computation of the Transitive Closure: The Dependency Graph Approach},
booktitle = {Recent Advances in Parallel Virtual Machine and Message Passing Interface, 8th European PVM/MPI Users' Group Meeting},
pages = {249--256},
year = 2001,
editor = {Yannis Cotronis and Jack Dongarra},
volume = 2131,
series = {Lecture Notes in Computer Science},
month = {September},
publisher = {Springer},
pdf = {PAPERS/PagourtzisPotapovRytterTC01.pdf},
keywords = {Transitive closure, PVM} 
}


Internal reports
  1. Lubos Brim, Ivana Cerná, Pavel Krcál, and Radek Pelánek. Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths. Technical report FIMU-RS-2001-01, Faculty of Informatics, Masaryk University, May 2001. [PDF] Keyword(s): Single-source shortest paths. 
    @TechReport{BrimCernaKrcalSSSP01b,
author = {Lubo\v{s} Brim and Ivana \v{C}ern{\'a} and Pavel Kr{\v{c}}{\'a}l and Radek Pel{\'a}nek},
title = {Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths},
institution = {Faculty of Informatics, Masaryk University},
year = 2001,
number = {FIMU-RS-2001-01},
month = {May},
keywords = {Single-source shortest paths},
pdf = {PAPERS/BrimCernaKrcalSSSP01b.pdf} 
}


  2. A.V. Goldberg. A simple shortest path algorithm with linear average time. Technical report, STAR Lab., InterTrust Tech., Inc., 2001. 
    @Techreport{Goldberg01:Caliber,
author = {A.V. Goldberg},
title = {A simple shortest path algorithm with linear average time},
year = 2001,
institution = {{STAR} Lab., InterTrust Tech., Inc.} 
}



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