BACK TO INDEX

 Conference articles on CSC
 2009
1. M. Manguoglu, A. Sameh, and O. Schenk. PSPIKE: Parallel sparse linear system solver. In In Proc. Euro-Par 2009 Parallel Processing, pages 797-808, 2009.

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

 2007
1. E. Agullo, A. Guermouche, and J.-Y. L'Excellent. Reducing the I/O volume in an out-of-core sparse multifrontal solver. In S. Aluru, M. Parashar, R. Badrinath, and V. K. Prasanna, editors, High Performance Computing -- HiPC2007; 14th International Conference, volume 4873 of Lecture Notes in Computer Science, pages 260-280, 2007. Keyword(s): Out-of-core factorization, Multifrontal method, Task scheduling, Elimination tree.

2. B. Hendrickson and A. Pothen. Combinatorial scientific computing: The enabling power of discrete algorithms in computational science. In M. Dayde, M. L. M. Palma, L. G. A. Coutinho, E. Pacitti, and J. C. Lopes, editors, High Performance Computing for Computational Science---VECPAR 2006, volume 4395 of Lecture Notes in Computer Science, pages 260-280, 2007. Keyword(s): Minimum degree ordering algorithm, Coloring, Jacobian matrix, Sparse Hessian matrix.

 2005
1. D. Bozdag, Ü. V. Çatalyürek, A. H. Gebremedhin, F. Manne, E. G. Boman, and F. Özgüner. A parallel distance-2 graph coloring algorithm for distributed memory computers. In L. T. Yang, O. F. Rana, B. Di Martino, and J. Dongarra, editors, Proceedings of 2005 International Conference on High Performance Computing and Communications (HPCC-05), volume 3726 of Lecture Notes in Computer Science, pages 796-806, 2005.

 2004
1. D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC'04: Proceedings of the 36th annual ACM symposium on Theory of computing, New York, NY, USA, pages 81-90, 2004. ACM.

 2003
1. D. A. Spielman and S.-H. Teng. Solving sparse, symmetric, diagonally dominant linear systems in time $\mathcal{O}(m^{1.31})$. In 44th Annual IEEE Symposium on Foundations of Computer Science, pages 416-427, 2003. IEEE.

 2001
1. Ü. V. Çatalyürek and C. Aykanat. A fine-grain hypergraph model for $2$D decomposition of sparse matrices. In Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS, San Francisco, CA, 2001. Keyword(s): Sparse matrix-vector multiplication, Hypergraph partitioning, Hypergraph model, Communication cost.

2. P. Heggernes, S. C. Eisenstat, G. Kumfert, and A. Pothen. The computational complexity of the minimum degree algorithm. In Proceedings of NIK 2001---14th Norwegian Computer Science Conference, Tromso, Norway, pages 98-109, 2001.

 2000
1. R. S. Tuminaro and C. Tong. Parallel smoothed aggregation multigrid: Aggregation strategies on massively parallel machines. In Supercomputing '00: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM), Washington, DC, USA, pages 5, 2000. IEEE Computer Society.

 1999
1. J. R. Gilbert and S. Toledo. High-performance out-of-core sparse LU factorization. In 9th SIAM Conference on Parallel Processing for Scientific Computing (CDROM), pages p.10, 1999.

 1997
1. G. Karypis and V. Kumar. Parallel threshold-based ILU factorization. In Supercomputing '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM), New York, NY, USA, pages 1-24, 1997. ACM.

 1995
1. K. D. Gremban, G. L. Miller, and M. Zagha. Performance evaluation of a parallel preconditioner. In 9th International Parallel Processing Symposium, Santa Barbara, pages 65-69, April 1995. IEEE.

2. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Supercomputing '95: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), New York, NY, USA, pages 28, 1995. ACM.

 1993
1. R. H. Bisseling. Parallel Iterative Solution of Sparse Linear Systems on a Transputer Network. In A. E. Fincham and B. Ford, editors, Parallel Computation, volume 46 of The Institute of Mathematics and its Applications Conference Series. New Series, pages 253-271, 1993. Oxford University Press, Oxford, UK. Keyword(s): GMRES, Cyclic distribution, Sparse matrix-vector multiplication, Communication cost.

2. T. N. Bui and C. Jones. A heuristic for reducing fill-in in sparse matrix factorization. In 6th SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, Virginia, USA, pages 445-452, 1993. Keyword(s): Graph partitioning, Multilevel algorithm.

 1985
1. H. D. Simon. Incomplete LU preconditioners for conjugate-gradient-type iterative methods. In Proceedings of the 1985 Reservoir Simulation Symposium, Dallas, pages 387-396, February 1985.

 1982
1. I. S. Duff. Full matrix techniques in sparse Gaussian elimination. In G. A. Watson, editor, Proceedings of 1981 Dundee Biennal Conference on Numerical Analysis, volume 912 of Lecture Notes in Mathematics, pages 71-84, 1982.

2. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In DAC '82: Proceedings of the 19th Conference on Design Automation, Piscataway, NJ, USA, pages 175-181, 1982. IEEE Press.

 1974
1. D. J. Rose and G. F. Whitten. Automatic nested dissection. In ACM 74: Proceedings of the 1974 annual conference, New York, NY, USA, pages 82-88, 1974. ACM.

 1969
1. E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. In Proceedings of the 24th national conference, New York, NY, USA, pages 157-172, 1969. ACM.

BACK TO INDEX