Follow
Olga V. HOLTZ
Olga V. HOLTZ
Professor, Mathematics, University of California-Berkeley
Verified email at berkeley.edu - Homepage
Title
Cited by
Cited by
Year
Minimizing communication in numerical linear algebra
G Ballard, J Demmel, O Holtz, O Schwartz
SIAM Journal on Matrix Analysis and Applications 32 (3), 866-901, 2011
3562011
Fast linear algebra is stable
J Demmel, I Dumitriu, O Holtz
Numerische Mathematik 108 (1), 59-91, 2007
2782007
Communication-optimal parallel algorithm for strassen's matrix multiplication
G Ballard, J Demmel, O Holtz, B Lipshitz, O Schwartz
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
1722012
Graph expansion and communication costs of fast matrix multiplication
G Ballard, J Demmel, O Holtz, O Schwartz
Journal of the ACM (JACM) 59 (6), 1-23, 2013
1332013
Fast matrix multiplication is stable
J Demmel, I Dumitriu, O Holtz, R Kleinberg
Numerische Mathematik 106 (2), 199-224, 2007
922007
Communication-optimal parallel and sequential Cholesky decomposition
G Ballard, J Demmel, O Holtz, O Schwartz
Proceedings of the twenty-first annual symposium on Parallelism in …, 2009
892009
Hyperdeterminantal relations among symmetric principal minors
O Holtz, B Sturmfels
Journal of Algebra 316 (2), 634-648, 2007
772007
Hermite-Biehler, Routh-Hurwitz, and total positivity
O Holtz
arXiv preprint math/0512591, 2005
762005
Zonotopal algebra
O Holtz, A Ron
Advances in Mathematics 227 (2), 847-894, 2011
722011
Accurate and efficient expression evaluation and linear algebra
J Demmel, I Dumitriu, O Holtz, P Koev
Acta Numerica 17, 87-145, 2008
722008
Structured matrices, continued fractions, and root localization of polynomials
O Holtz, M Tyaglov
SIAM Review 54 (3), 421-509, 2012
682012
Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds
G Ballard, J Demmel, O Holtz, B Lipshitz, O Schwartz
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
532012
Open problems on GKK tau-matrices
O Holtz, H Schneider
arXiv preprint math/0109030, 2001
432001
Strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds
G Ballard, J Demmel, O Holtz, B Lipshitz, O Schwartz
arXiv preprint arXiv:1202.3177, 2012
352012
The inverse eigenvalue problem for symmetric anti-bidiagonal matrices
O Holtz
Linear algebra and its applications 408, 268-274, 2005
332005
𝑀-matrices satisfy Newton’s inequalities
O Holtz
Proceedings of the American Mathematical Society 133 (3), 711-717, 2005
322005
Graph expansion analysis for communication costs of fast rectangular matrix multiplication
G Ballard, J Demmel, O Holtz, B Lipshitz, O Schwartz
Mediterranean Conference on Algorithms, 13-36, 2012
302012
Approximation orders of shift-invariant subspaces of W2s (Rd)
O Holtz, A Ron
Journal of Approximation Theory 132 (1), 97-148, 2005
252005
Matrix multiplication I/O-complexity by path routing
J Scott, O Holtz, O Schwartz
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015
242015
Communication costs of Strassen's matrix multiplication
G Ballard, J Demmel, O Holtz, O Schwartz
Communications of the ACM 57 (2), 107-114, 2014
242014
The system can't perform the operation now. Try again later.
Articles 1–20