Olga Holtz

Orcid: 0000-0003-3420-3423

Affiliations:
  • University of California, Berkeley, USA


According to our database1, Olga Holtz authored at least 26 papers between 2004 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Communication bounds for convolutional neural networks.
Proceedings of the PASC '22: Platform for Advanced Scientific Computing Conference, Basel, Switzerland, June 27, 2022

2020
Sparsifying the Operators of Fast Matrix Multiplication Algorithms.
CoRR, 2020

2015
Matrix Multiplication I/O-Complexity by Path Routing.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
Communication costs of Strassen's matrix multiplication.
Commun. ACM, 2014

2012
Structured Matrices, Continued Fractions, and Root Localization of Polynomials.
SIAM Rev., 2012

Szegő's theorem for matrix orthogonal polynomials.
J. Approx. Theory, 2012

Graph expansion and communication costs of fast matrix multiplication.
J. ACM, 2012

Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
CoRR, 2012

Communication-optimal parallel algorithm for strassen's matrix multiplication.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication.
Proceedings of the Design and Analysis of Algorithms, 2012

2011
Minimizing Communication in Numerical Linear Algebra.
SIAM J. Matrix Anal. Appl., 2011

Graph expansion and communication costs of fast matrix multiplication: regular submission.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010
Communication-optimal Parallel and Sequential Cholesky Decomposition.
SIAM J. Sci. Comput., 2010

2009
Computational Complexity and Numerical Stability of Linear Problems
CoRR, 2009

Minimizing Communication in Linear Algebra
CoRR, 2009

Communication-optimal parallel and sequential Cholesky decomposition: extended abstract.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008
Functions Preserving Nonnegativity of Matrices.
SIAM J. Matrix Anal. Appl., 2008

Compressive sensing: a paradigm shift in signal processing.
CoRR, 2008

2007
Fast matrix multiplication is stable.
Numerische Mathematik, 2007

Fast linear algebra is stable.
Numerische Mathematik, 2007

Accurate and Efficient Expression Evaluation and Linear Algebra
CoRR, 2007

2005
Approximation orders of shift-invariant subspaces of W<sup>s</sup><sub>2</sub>(R<sup>d</sup>).
J. Approx. Theory, 2005

Toward accurate polynomial evaluation in rounded arithmetic
CoRR, 2005

Toward accurate polynomial evaluation in rounded arithmetic (short report).
Proceedings of the Algebraic and Numerical Algorithms and Computer-assisted Proofs, 2005

2004
Potter, Wielandt, and Drazin on the Matrix Equation AB = ωBA: New Answers to Old Questions.
Am. Math. Mon., 2004


  Loading...