BACK TO INDEX

Publications in year 2008 on CSC

Thesis

1. E. Agullo. On the out-of-core factorization of large sparse matrices. PhD thesis, Ecole Normale Supérieure de Lyon, Lyon, France, 2008.



2. M. Halappanavar. Algorithms for Vertex-Weighted Matching in Graphs. PhD thesis, Old Dominion University, Norfolk, Virginia, USA, 2008.

Articles in journal or book chapters

1. E. Agullo, A. Guermouche, and J.-Y. L'Excellent. A parallel out-of-core multifrontal method: Storage of factors on disk and analysis of models for an out-of-core active memory. Parallel Computing, 34(6-8):296-317, 2008. Keyword(s): Out-of-core factorization, Multifrontal method.



2. M. Elkin, Y. Emek, D. A. Spielman, and S.-H. Teng. Lower-stretch spanning trees. SIAM Journal on Computing, 38(2):608-628, 2008.



3. P. Hénon, P. Ramet, and J. Roman. On finding approximate supernodes for an efficient block-ILU(k) factorization. Parallel Computing, 34(6--8):345-362, 2008.



4. H. de Sterck, R. D. Falgout, J. W. Nolting, and U. M. Yang. Distance-two interpolation for parallel algebraic multigrid. Numerical Linear Algebra with Applications, 15(2--3):115-139, MAR-APR 2008.

Conference articles

1. F. Manne and R. H. Bisseling. A parallel approximation algorithm for the weighted maximum matching problem. In Roman Wyrzykowski, Konrad Karczewski, Jack Dongarra, and Jerzy Wasniewski, editors, Parallel Processing and Applied Mathematics, volume 4967 of Lecture Notes in Computer Science, pages 708-717, 2008.



2. S. Toledo and A. Uchitel. A supernodal out-of-core sparse Gaussian-elimination method. In Roman Wyrzykowski, Konrad Karczewski, Jack Dongarra, and Jerzy Wasniewski, editors, 7th International Conference on Parallel Processing and Applied Mathematics (PPAM 2007),, volume 4967 of Lecture Notes in Computer Science, pages 728-737, 2008. Springer-Verlag Berlin Heidelberg.

Internal reports

1. J. K. Reid and J. A. Scott. An efficient out-of-core sparse symmetric indefinite direct solver. Technical report RAL-TR-2008-024, Computational Sciences and Engineering Department, Rutherford Appleton Laboratory, Oxon, OX11 0QX, England, December 2008.

Manuals, booklets

1. F. Pellegrini. SCOTCH 5.1 User's Guide. Laboratoire Bordelais de Recherche en Informatique (LaBRI), 2008. Keyword(s): Graph partitioning, Sparse matrix ordering, Nested dissection.

Miscellaneous

1. I. S. Duff, D. Ruiz, and B. Uçar. Computing a class of bipartite matchings in parallel. Presentation at SIAM 13th Conference on Parallel Processing for Scientific Computing (PP08), Atlanta, GA, USA, March 2008. Keyword(s): Matching.

BACK TO INDEX

---

Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.