The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Algorithm 408: a sparse matrix package (part I) [F4]
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Arithmetic complexity of unordered sparse polynomials
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
On the efficient solution of sparse systems of linear and nonlinear equations.
On the efficient solution of sparse systems of linear and nonlinear equations.
A high performance algorithm using pre-processing for the sparse matrix-vector multiplication
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Automatic Data Structure Selection and Transformation for Sparse Matrix Computations
IEEE Transactions on Parallel and Distributed Systems
Remark on “Algorithm 49: Spherical Neumann Function”
ACM Transactions on Mathematical Software (TOMS)
A Sparse Matrix Package—Part II: Special Cases
ACM Transactions on Mathematical Software (TOMS)
Remark on algorithm 408: a sparse matrix package (part 1) [F4]
ACM Transactions on Mathematical Software (TOMS)
Chain mulitplication of matrices of approximately or exactly the same size
Communications of the ACM
Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A column approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
Flyspeck II: the basic linear programs
Annals of Mathematics and Artificial Intelligence
Sparse matrix algebra for quantum modeling of large systems
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
RFID data analysis using tensor calculus for supply chain management
Proceedings of the 20th ACM international conference on Information and knowledge management
Proving bounds for real linear programs in Isabelle/HOL
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Multi-robot adversarial patrolling: facing a full-knowledge opponent
Journal of Artificial Intelligence Research
Implicit solutions with consistent additive and multiplicative components
Finite Elements in Analysis and Design
Sparse Givens resolution of large system of linear equations: Applications to image reconstruction
Mathematical and Computer Modelling: An International Journal
Space-round tradeoffs for MapReduce computations
Proceedings of the 26th ACM international conference on Supercomputing
Communication optimal parallel multiplication of sparse random matrices
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.02 |