| 2009 |
|---|
| 30 | EE | Timothy A. Davis,
William W. Hager:
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves.
ACM Trans. Math. Softw. 35(4): (2009) |
| 2008 |
|---|
| 29 | EE | Sarah Matzko,
Timothy A. Davis:
A graphics-based approach to data structures.
ITiCSE 2008: 109-113 |
| 28 | EE | Yanqing Chen,
Timothy A. Davis,
William W. Hager,
Sivasankaran Rajamanickam:
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate.
ACM Trans. Math. Softw. 35(3): (2008) |
| 27 | EE | Timothy A. Davis,
William W. Hager:
A sparse proximal implementation of the LP dual active set algorithm.
Math. Program. 112(2): 275-301 (2008) |
| 26 | EE | Timothy A. Davis,
William W. Hager:
Dual multilevel optimization.
Math. Program. 112(2): 403-425 (2008) |
| 2007 |
|---|
| 25 | EE | Daniel Ott,
Timothy A. Davis:
Simulating a virtual fisheye lens for the production of full-dome animations.
ACM Southeast Regional Conference 2007: 294-299 |
| 24 | EE | Jamie Kelley,
Rupali Parekh,
Michela Rose,
Timothy A. Davis,
Lucas McDaniel,
Rachel Drews,
Yu-Ting Chiu:
Femme avec une Fleur.
ACM Southeast Regional Conference 2007: 551 |
| 23 | EE | Timothy A. Davis,
Robert Geist,
Sarah Matzko,
James Westall:
tauepsilonChinueta: trial phase for the new curriculum.
SIGCSE 2007: 415-419 |
| 2006 |
|---|
| 22 | EE | Edward Siomacco,
John L. Kundert-Gibbs,
Timothy A. Davis:
Developing efficient pipeline tools for animation production.
ACM Southeast Regional Conference 2006: 780-781 |
| 21 | EE | Sarah Matzko,
Timothy A. Davis:
Teaching CS1 with graphics and C.
ITiCSE 2006: 168-172 |
| 20 | EE | Timothy A. Davis,
John L. Kundert-Gibbs:
The role of computer science in digital production arts.
ITiCSE 2006: 73-77 |
| 2005 |
|---|
| 19 | EE | Timothy A. Davis:
Algorithm 849: A concise sparse cholesky factorization package.
ACM Trans. Math. Softw. 31(4): 587-591 (2005) |
| 2004 |
|---|
| 18 | EE | S. Wang,
Timothy A. Davis,
Robert Geist,
James Westall,
John L. Kundert-Gibbs:
Digital production arts: coming soon to a college near you!
ACM Southeast Regional Conference 2004: 416-421 |
| 17 | EE | Timothy A. Davis,
Robert Geist,
Sarah Matzko,
James Westall:
tau varepsilon chi nu eta: a first step.
SIGCSE 2004: 125-129 |
| 16 | EE | Timothy A. Davis:
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method.
ACM Trans. Math. Softw. 30(2): 165-195 (2004) |
| 15 | EE | Timothy A. Davis:
Algorithm 832: UMFPACK V4.3 - an unsymmetric-pattern multifrontal method.
ACM Trans. Math. Softw. 30(2): 196-199 (2004) |
| 14 | EE | Timothy A. Davis,
John R. Gilbert,
Stefan I. Larimore,
Esmond G. Ng:
A column approximate minimum degree ordering algorithm.
ACM Trans. Math. Softw. 30(3): 353-376 (2004) |
| 13 | EE | Timothy A. Davis,
John R. Gilbert,
Stefan I. Larimore,
Esmond G. Ng:
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm.
ACM Trans. Math. Softw. 30(3): 377-380 (2004) |
| 12 | EE | Patrick Amestoy,
Enseeiht-Irit,
Timothy A. Davis,
Iain S. Duff:
Algorithm 837: AMD, an approximate minimum degree ordering algorithm.
ACM Trans. Math. Softw. 30(3): 381-388 (2004) |
| 2000 |
|---|
| 11 | EE | Sartaj Sahni,
Timothy A. Davis,
Sanguthevar Rajasekaran,
Sanjay Ranka:
Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel.
IPDPS Workshops 2000: 423-426 |
| 1999 |
|---|
| 10 | EE | Timothy A. Davis,
Iain S. Duff:
A combined unifrontal/multifrontal method for unsymmetric sparse matrices.
ACM Trans. Math. Softw. 25(1): 1-20 (1999) |
| 1998 |
|---|
| 9 | EE | Timothy A. Davis:
Generating computer animations with frame coherence in a distributed computing environment.
ACM Southeast Regional Conference 1998: 1-7 |
| 1996 |
|---|
| 8 | | Theodore Johnson,
Timothy A. Davis,
Steven M. Hadfield:
A Concurrent Dynamic Task Graph.
Parallel Computing 22(2): 327-333 (1996) |
| 1995 |
|---|
| 7 | | Steven M. Hadfield,
Timothy A. Davis:
A Distributed Memory, Multifrontal Method for Sequences of Unsymmetric Pattern Matrices.
ICPP (3) 1995: 42-45 |
| 6 | | Tariq Rashid,
Timothy A. Davis:
An Approach for Parallelizing any General Unsymmetric Sparse Matrix Algorithm.
PPSC 1995: 413-417 |
| 1992 |
|---|
| 5 | | Theodore Johnson,
Timothy A. Davis:
Space Efficient Parallel Buddy Memory Management.
ICCI 1992: 128-132 |
| 4 | | Theodore Johnson,
Timothy A. Davis:
Parallel Buddy Memory Management.
Parallel Processing Letters 2: 391-398 (1992) |
| 1988 |
|---|
| 3 | | Santosh G. Abraham,
Timothy A. Davis:
Blocking for Parallel Sparse Linear System Solvers.
ICPP (1) 1988: 166-173 |
| 2 | | Timothy A. Davis,
Edward S. Davidson:
Pairwise Reduction for the Direct, Parallel Solution of Sparse, Unsymmetric Sets of Linear Equations.
IEEE Trans. Computers 37(12): 1648-1654 (1988) |
| 1987 |
|---|
| 1 | | Timothy A. Davis,
Edward S. Davidson:
PSOLVE : A Concurrent Algorithm for Solving Sparse Systems of Linear Equations.
ICPP 1987: 483-490 |
