2026 Timothy A. Davis: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	32	12838	12461	5174	4936	138	17493

Research.com Recognitions

2014 - ACM Fellow For contributions to sparse matrix algorithms and software.
2013 - SIAM Fellow For contributions to sparse matrix algorithms and software, including the University of Florida Sparse Matrix Collection.

Overview

Timothy A. Davis is affiliated with Texas A&M University in the United States and has a research portfolio that centers on computer science and engineering. Their work spans numerous subfields, including computer networks and communications, electrical and electronic engineering, artificial intelligence, computational theory and mathematics, and statistical and nonlinear physics.

The scientist's main research topics cover a range of areas such as complex network analysis techniques, VLSI and FPGA design techniques, graph theory and algorithms, parallel computing and optimization techniques, interconnection networks and systems, low-power high-performance VLSI design, and matrix theory and algorithms.

Recent papers by Timothy A. Davis include:

Algorithm 1037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra, 2023, ACM Transactions on Mathematical Software
Algorithm 1003, 2020, ACM Transactions on Mathematical Software
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization, 2022, ACM Transactions on Mathematical Software
Design and Implementation of a Parallel Markowitz Threshold Algorithm, 2020, SIAM Journal on Matrix Analysis and Applications
Algorithm 1050: SPEX Cholesky, LDL, and Backslash for Exactly Solving Sparse Linear Systems, 2024, ACM Transactions on Mathematical Software

Frequent coauthors in their publications are Jeremy Kepner, Chansup Byun, William Arcand, David Bestor, and William Bergeron.

Timothy A. Davis has published extensively in various venues. The most frequent publication platforms include:

arXiv (Cornell University)
ACM Transactions on Mathematical Software
SIAM Journal on Matrix Analysis and Applications
The Astrophysical Journal
Orthopaedic Proceedings

Their contributions have been recognized with honors including the ACM Fellow award in 2014, granted for contributions to sparse matrix algorithms and software, and the SIAM Fellow award in 2013, awarded for work on sparse matrix algorithms and software, including the University of Florida Sparse Matrix Collection.

Best Publications

The university of Florida sparse matrix collection

Timothy A. Davis;Yifan Hu

4851
Citations
Direct Methods for Sparse Linear Systems

Timothy A. Davis

2150
Citations
Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method

Timothy A. Davis

2018
Citations
An Approximate Minimum Degree Ordering Algorithm

Patrick R. Amestoy;Timothy A. Davis;Iain S. Duff

1072
Citations
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate

Yanqing Chen;Timothy A. Davis;William W. Hager;Sivasankaran Rajamanickam

954
Citations
An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization

Timothy A. Davis;Iain S. Duff

812
Citations
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method

Timothy A. Davis

560
Citations
A combined unifrontal/multifrontal method for unsymmetric sparse matrices

Timothy A. Davis;Iain S. Duff

535
Citations
Algorithm 837: AMD, an approximate minimum degree ordering algorithm

Patrick R. Amestoy;Timothy A. Davis;Iain S. Duff

446
Citations
Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems

Timothy A. Davis;Ekanathan Palamadai Natarajan

442
Citations
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization

Timothy A. Davis

322
Citations
A column approximate minimum degree ordering algorithm

Timothy A. Davis;John R. Gilbert;Stefan I. Larimore;Esmond G. Ng

292
Citations
A survey of direct methods for sparse linear systems

Timothy A. Davis;Sivasankaran Rajamanickam;Wissam M. Sid-Lakhdar

291
Citations
Modifying a Sparse Cholesky Factorization

Timothy A. Davis;William W. Hager

199
Citations
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves

Timothy A. Davis;William W. Hager

176
Citations
Algorithm 849: A concise sparse Cholesky factorization package

Timothy A. Davis

167
Citations
Algorithm 1000: SuiteSparse:GraphBLAS: Graph Algorithms in the Language of Sparse Linear Algebra

Timothy A. Davis

162
Citations
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm

Timothy A. Davis;John R. Gilbert;Stefan I. Larimore;Esmond G. Ng

161
Citations
The SuiteSparse Matrix Collection Website Interface

Scott P. Kolodziej;Mohsen Aznaveh;Matthew Bullock;Jarrett David

132
Citations
Row Modifications of a Sparse Cholesky Factorization

Timothy A. Davis;William W. Hager

129
Citations

Frequent Co-Authors

Jeremy Kepner MIT

William W. Hager University of Florida

Iain S. Duff Rutherford Appleton Laboratory

Michael Jones Mitsubishi Electric (United States)

Aydin Buluc Lawrence Berkeley National Laboratory

John R. Gilbert University of California, Santa Barbara

Sanjay Ranka University of Florida

David A. Bader New Jersey Institute of Technology

Anil V. Rao University of Florida

Pen-Chung Yew University of Minnesota

External Links

Personal website of Timothy A. Davis

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online education can open up new opportunities for Computer Science students and professionals. Many choose to broaden their expertise in fields that complement computing, such as physics, data science, or engineering. For those interested in a scientific foundation, pursuing an online physics bachelor's degree can enhance problem-solving and analytical skills vital for tech roles.

Data science is another booming area. Graduate students can save money by enrolling in the cheapest data science masters in usa, gaining expertise in analytics, AI, and big data at an affordable cost. Similarly, electrical engineering skills are in high demand, and the best online electrical engineering programs USA offer flexible learning designed for working professionals.

Quick credentials can also accelerate career growth. Consider certificate programs that pay well to boost your résumé and access higher-paying tech or IT jobs. Exploring these related online pathways can help expand your computer science career, skills, and future job prospects.