| Publication | Date of Publication | Type |
|---|
| Fault tolerance with high performance for fast matrix multiplication | 2024-05-15 | Paper |
| Fault tolerant resource efficient matrix multiplication | 2024-05-14 | Paper |
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
SIAM Journal on Scientific Computing | 2023-11-16 | Paper |
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
Matrix multiplication, a little faster
Journal of the ACM | 2020-11-11 | Paper |
Revisiting ``Computation of matrix chain products
SIAM Journal on Computing | 2019-09-16 | Paper |
Communication lower bounds and optimal algorithms for numerical linear algebra
Acta Numerica | 2018-09-26 | Paper |
High-performance direct algorithms for computing the sign function of triangular matrices.
Numerical Linear Algebra with Applications | 2018-04-18 | Paper |
Delay-Doppler Channel Estimation in Almost Linear Complexity
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
SIAM Journal on Scientific Computing | 2016-11-18 | Paper |
Improving the numerical stability of fast matrix multiplication
SIAM Journal on Matrix Analysis and Applications | 2016-10-12 | Paper |
Communication-avoiding symmetric-indefinite factorization
SIAM Journal on Matrix Analysis and Applications | 2015-04-21 | Paper |
| An elementary construction of constant-degree expanders | 2014-12-18 | Paper |
Graph expansion and communication costs of fast matrix multiplication
Journal of the ACM | 2014-02-17 | Paper |
Graph expansion analysis for communication costs of fast rectangular matrix multiplication
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Graph expansion analysis for communication costs of fast rectangular matrix multiplication
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Colorful strips
Graphs and Combinatorics | 2012-01-24 | Paper |
Minimizing communication in numerical linear algebra
SIAM Journal on Matrix Analysis and Applications | 2012-01-16 | Paper |
Communication-optimal parallel and sequential Cholesky decomposition
SIAM Journal on Scientific Computing | 2011-08-01 | Paper |
Communication-optimal parallel and sequential Cholesky decomposition
SIAM Journal on Scientific Computing | 2011-08-01 | Paper |
scientific article; zbMATH DE number 5899289 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
Cooperative TSP
Theoretical Computer Science | 2010-07-07 | Paper |
On the complexity of approximating \(k\)-dimensional matching
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Colorful strips
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
On the complexity of approximating TSP with neighborhoods and related problems
Lecture Notes in Computer Science | 2010-03-03 | Paper |
An Elementary Construction of Constant-Degree Expanders
Combinatorics, Probability and Computing | 2008-12-11 | Paper |
Cooperative TSP
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On the complexity of approximating TSP with neighborhoods and related problems
Computational Complexity | 2006-11-17 | Paper |
On the complexity of approximating \(k\)-set packing
Computational Complexity | 2006-09-28 | Paper |
