Potter, Wielandt, and Drazin on the Matrix Equation AB = ωBA: New Answers to Old Questions. - Olga Holtz; Volker Mehrmann; Hans Schneider (Am. Math. Mon., 2004)

Toward accurate polynomial evaluation in rounded arithmetic (short report). - James Demmel; Ioana Dumitriu; Olga Holtz (Algebraic and Numerical Algorithms and Computer-assisted Proofs, 2005)

Toward accurate polynomial evaluation in rounded arithmetic - James Demmel; Ioana Dumitriu; Olga Holtz (CoRR, 2005)

Approximation orders of shift-invariant subspaces of Ws2(Rd). - Olga Holtz; Amos Ron (J. Approx. Theory, 2005)

Accurate and Efficient Expression Evaluation and Linear Algebra - James Demmel; Ioana Dumitriu; Olga Holtz; Plamen Koev (CoRR, 2007)

Fast linear algebra is stable. - James Demmel; Ioana Dumitriu; Olga Holtz (Numerische Mathematik, 2007)

Fast matrix multiplication is stable. - James Demmel; Ioana Dumitriu; Olga Holtz; Robert Kleinberg (Numerische Mathematik, 2007)

Compressive sensing: a paradigm shift in signal processing. - Olga Holtz (CoRR, 2008)

Functions Preserving Nonnegativity of Matrices. - Gautam Bharali; Olga Holtz (SIAM J. Matrix Anal. Appl., 2008)

Communication-optimal parallel and sequential Cholesky decomposition: extended abstract. - Grey Ballard; James Demmel; Olga Holtz; Oded Schwartz (SPAA, 2009)

Minimizing Communication in Linear Algebra - Grey Ballard; James Demmel; Olga Holtz; Oded Schwartz (CoRR, 2009)

Computational Complexity and Numerical Stability of Linear Problems - Olga Holtz; Noam Shomron (CoRR, 2009)

Communication-optimal Parallel and Sequential Cholesky Decomposition. - Grey Ballard; James Demmel; Olga Holtz; Oded Schwartz (SIAM J. Sci. Comput., 2010)

Graph expansion and communication costs of fast matrix multiplication: regular submission. - Grey Ballard; James Demmel; Olga Holtz; Oded Schwartz (SPAA, 2011)

Minimizing Communication in Numerical Linear Algebra. - Grey Ballard; James Demmel; Olga Holtz; Oded Schwartz (SIAM J. Matrix Anal. Appl., 2011)

Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication. - Grey Ballard; James Demmel; Olga Holtz; Benjamin Lipshitz; Oded Schwartz (MedAlg, 2012)

Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. - Grey Ballard; James Demmel; Olga Holtz; Benjamin Lipshitz; Oded Schwartz (SPAA, 2012)

Communication-optimal parallel algorithm for strassen's matrix multiplication. - Grey Ballard; James Demmel; Olga Holtz; Benjamin Lipshitz; Oded Schwartz (SPAA, 2012)

Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds - Grey Ballard; James Demmel; Olga Holtz; Benjamin Lipshitz; Oded Schwartz (CoRR, 2012)

Graph expansion and communication costs of fast matrix multiplication. - Grey Ballard; James Demmel; Olga Holtz; Oded Schwartz (J. ACM, 2012)

Szegő's theorem for matrix orthogonal polynomials. - Maxim S. Derevyagin; Olga Holtz; Sergey Khrushchev; Mikhail Tyaglov (J. Approx. Theory, 2012)

Structured Matrices, Continued Fractions, and Root Localization of Polynomials. - Olga Holtz; Mikhail Tyaglov (SIAM Rev., 2012)

Communication costs of Strassen's matrix multiplication. - Grey Ballard; James Demmel; Olga Holtz; Oded Schwartz (Commun. ACM, 2014)

Matrix Multiplication I/O-Complexity by Path Routing. - Jacob Scott; Olga Holtz; Oded Schwartz (SPAA, 2015)

Sparsifying the Operators of Fast Matrix Multiplication Algorithms. - Gal Beniamini; Nathan Cheng; Olga Holtz; Elaye Karstadt; Oded Schwartz (CoRR, 2020)

Communication bounds for convolutional neural networks. - Anthony Chen; James Demmel; Grace Dinh; Mason Haberle; Olga Holtz (PASC, 2022)