On the public citation graph
Recursive blocked data formats and BLAS’s for dense linear algebra algorithms
0 signed · 67 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bfb0095328openalex-snapshot
New serial and parallel recursive QR factorization algorithms for SMP systems
inferredcites →https://doi.org/10.1007/bfb0095338openalex-snapshot
Superscalar GEMM-based level 3 BLAS—The on-going evolution of a portable and high-performance library
inferredcites →https://doi.org/10.1137/s0895479896297744openalex-snapshot
Locality of Reference in LU Decomposition with Partial Pivoting
inferredcites →https://doi.org/10.1145/77626.79170openalex-snapshot
A set of level 3 basic linear algebra subprograms
inferredcites →https://doi.org/10.1147/rd.383.0265openalex-snapshot
Improving performance of linear algebra algorithms for dense matrices, using algorithmic prefetch
inferredcites →https://doi.org/10.1147/rd.416.0737openalex-snapshot
Recursion leads to automatic variable blocking for dense linear-algebra algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.630openalex-snapshot
A framework for high‐performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low‐level kernels
inferred← citeshttps://doi.org/10.1002/spe.626openalex-snapshot
Minimizing development and maintenance costs in supporting persistently optimized BLAS
inferred← citeshttps://doi.org/10.1007/11532378_10openalex-snapshot
JuliusC: A Practical Approach for the Analysis of Divide-and-Conquer Algorithms
inferred← citeshttps://doi.org/10.1007/11558958_3openalex-snapshot
Management of Deep Memory Hierarchies – Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Computations
inferred← citeshttps://doi.org/10.1007/11558958_30openalex-snapshot
A Family of High-Performance Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44688-5_3openalex-snapshot
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance
inferred← citeshttps://doi.org/10.1007/3-540-45492-6_78openalex-snapshot
LAWRA Workshop Linear Algebra with Recursive Algorithms http://lawra.uni-c.dk/lawra/
inferred← citeshttps://doi.org/10.1007/3-540-45545-0_15openalex-snapshot
A Family of High-Performance Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-46080-2_35openalex-snapshot
Parallel and Fully Recursive Multifrontal Supernodal Sparse Cholesky
inferred← citeshttps://doi.org/10.1007/3-540-48051-x_29openalex-snapshot
A Recursive Formulation of the Inversion of Symmetric Positive Definite Matrices in Packed Storage Data Format
inferred← citeshttps://doi.org/10.1007/3-540-48051-x_30openalex-snapshot
Parallel Two-Sided Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking
inferred← citeshttps://doi.org/10.1007/3-540-48086-2_47openalex-snapshot
New Generalized Data Structures for Matrices Lead to a Variety of High Performance Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-70734-4_10openalex-snapshot
Parallel Triangular Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking
inferred← citeshttps://doi.org/10.1007/3-540-70734-4_12openalex-snapshot
High Performance Cholesky Factorization via Blocking and Recursion That Uses Minimal Storage
inferred← citeshttps://doi.org/10.1007/3-540-70734-4_14openalex-snapshot
A Fast Minimal Storage Symmetric Indefinite Solver
inferred← citeshttps://doi.org/10.1007/3-540-70734-4_7openalex-snapshot
LAWRA Linear Algebra with Recursive Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-35407-1_13openalex-snapshot
New Generalized Matrix Data Structures Lead to a Variety of High-Performance Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4419-6935-4_2openalex-snapshot
ATLAS Version 3.9: Overview and Status
inferred← citeshttps://doi.org/10.1007/978-3-030-29400-7_35openalex-snapshot
Linear Systems Solvers for Distributed-Memory Machines with GPU Accelerators
inferred← citeshttps://doi.org/10.1007/978-3-540-24644-2_16openalex-snapshot
Improving the Performance of Morton Layout by Array Alignment and Loop Unrolling
inferred← citeshttps://doi.org/10.1007/978-3-540-68111-3_69openalex-snapshot
New Data Structures for Matrices and Specialized Inner Kernels: Low Overhead for High Performance
inferred← citeshttps://doi.org/10.1007/978-3-540-75755-9_109openalex-snapshot
Is Cache-Oblivious DGEMM Viable?
inferred← citeshttps://doi.org/10.1007/978-3-540-75755-9_70openalex-snapshot
Using Non-canonical Array Layouts in Dense Matrix Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-28145-7_27openalex-snapshot
Cache-Oblivious Algorithms and Matrix Formats for Computations on Interval Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-57313-2_4openalex-snapshot
New Generalized Data Structures for Matrices Lead to a Variety of High-Performance Algorithms
inferred← citeshttps://doi.org/10.1007/bfb0095338openalex-snapshot
Superscalar GEMM-based level 3 BLAS—The on-going evolution of a portable and high-performance library
inferred← citeshttps://doi.org/10.1007/s00453-006-1224-zopenalex-snapshot
R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks
inferred← citeshttps://doi.org/10.1007/s10115-016-0981-5openalex-snapshot
A distributed approach for accelerating sparse matrix arithmetic operations for high-dimensional feature selection
inferred← citeshttps://doi.org/10.1007/s10766-017-0515-0openalex-snapshot
Efficient Processing of Large Data Structures on GPUs: Enumeration Scheme Based Optimisation
inferred← citeshttps://doi.org/10.1016/j.future.2003.07.007openalex-snapshot
Parallel and fully recursive multifrontal sparse Cholesky
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00087-9openalex-snapshot
Automated empirical optimizations of software and the ATLAS project
inferred← citeshttps://doi.org/10.1080/13926292.1999.9637105openalex-snapshot
Lawra – linear algebra with recursive algorithms
inferred← citeshttps://doi.org/10.1109/cluster.2011.16openalex-snapshot
Achieving Scalable Parallelization for the Hessenberg Factorization
inferred← citeshttps://doi.org/10.1109/imcsit.2008.4747256openalex-snapshot
Empirically tuning LAPACK’s blocking factor for increased performance
inferred← citeshttps://doi.org/10.1109/jproc.2004.840848openalex-snapshot
Self-Adapting Linear Algebra Algorithms and Software
inferred← citeshttps://doi.org/10.1109/tcad.2019.2925377openalex-snapshot
MemFlow: Memory-Driven Data Scheduling With Datapath Co-Design in Accelerators for Large-Scale Inference Applications
inferred← citeshttps://doi.org/10.1109/tpds.2008.78openalex-snapshot
Improving Performance of Dynamic Programming via Parallelism and Locality on Multicore Architectures
inferred← citeshttps://doi.org/10.1137/s0036144503428693openalex-snapshot
Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
inferred← citeshttps://doi.org/10.1145/1391989.1391992openalex-snapshot
Dense Linear Algebra over Word-Size Prime Fields
inferred← citeshttps://doi.org/10.1145/2049673.2049674openalex-snapshot
Partial factorization of a dense symmetric indefinite matrix
inferred← citeshttps://doi.org/10.1145/2168773.2168775openalex-snapshot
Parallel and Cache-Efficient In-Place Matrix Storage Format Conversion
inferred← citeshttps://doi.org/10.1145/2486159.2486198openalex-snapshot
Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout
inferred← citeshttps://doi.org/10.1145/3330345.3330356openalex-snapshot
Least squares solvers for distributed-memory machines with GPU accelerators
inferred← citeshttps://doi.org/10.1145/378580.378743openalex-snapshot
A parallel block algorithm for exact triangularization of rectangular matrices
inferred← citeshttps://doi.org/10.1145/383738.383741openalex-snapshot
A recursive formulation of Cholesky factorization of a matrix in packed storage
inferred← citeshttps://doi.org/10.1145/592843.592845openalex-snapshot
Recursive blocked algorithms for solving triangular systems—Part I
inferred← citeshttps://doi.org/10.1145/780506.780515openalex-snapshot
Finite field linear algebra subroutines
inferred← citeshttps://doi.org/10.1147/rd.446.0823openalex-snapshot
Minimal-storage high-performance Cholesky factorization via blocking and recursion
inferred← citeshttps://doi.org/10.1147/rd.471.0031openalex-snapshot
High-performance linear algebra algorithms using new generalized data structures for matrices
inferred← citeshttps://doi.org/10.1155/2001/569670openalex-snapshot
Recursive Approach in Sparse Matrix LU Factorization
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4486openalex-snapshot
Maintaining High Performance Across All Problem Sizes and Parallel Scales Using Microkernel-based Linear Algebra
inferred← citeshttps://doi.org/10.48550/arxiv.1904.05347openalex-snapshot
Cross-Platform Performance Portability Using Highly Parametrized SYCL Kernels
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601133openalex-snapshot
Dense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93306openalex-snapshot
A framework for efficient execution of matrix computations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.