BACK TO INDEX

Thesis on CSC

2008

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.

2007

1. I. Koutis. Combinatorial and algebraic tools for multigrid algorithms. PhD thesis, Carnegie Mellon University, Pittsburgh, May 2007.

2001

1. F. Dobrian. External Memory Algorithms for Factoring Sparse Matrices. PhD thesis, Old Dominion University, Norfolk, Virginia, USA, 2001.

1996

1. K. D. Gremban. Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA, 1996.



2. A. Joshi. Topics in Optimization and Sparse Linear Systems. PhD thesis, Department of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL, USA, December 1996.

1984

1. A. Pothen. Sparse Null Bases and Marriage Theorems. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, 1984.

1972

1. I. S. Duff. Analysis of Sparse Systems. PhD thesis, Oxford University, England, 1972.

1971

1. A. J. George. Computer Implementation of the Finite Element Method. PhD thesis, Stanford University, Stanford, CA, USA, 1971.

BACK TO INDEX

---

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