default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlga Holtz
Person information
- affiliation: University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j11]Grey Ballard
, James Demmel, Olga Holtz, Oded Schwartz:
Communication costs of Strassen's matrix multiplication. Commun. ACM 57(2): 107-114 (2014)- 2012
- [j10]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Graph expansion and communication costs of fast matrix multiplication. J. ACM 59(6): 32:1-32:23 (2012) - [j9]Maxim S. Derevyagin, Olga Holtz, Sergey Khrushchev, Mikhail Tyaglov:
Szegő's theorem for matrix orthogonal polynomials. J. Approx. Theory 164(9): 1238-1261 (2012) - [j8]Olga Holtz, Mikhail Tyaglov:
Structured Matrices, Continued Fractions, and Root Localization of Polynomials. SIAM Rev. 54(3): 421-509 (2012) - 2011
- [j7]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Minimizing Communication in Numerical Linear Algebra. SIAM J. Matrix Anal. Appl. 32(3): 866-901 (2011) - 2010
- [j6]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Communication-optimal Parallel and Sequential Cholesky Decomposition. SIAM J. Sci. Comput. 32(6): 3495-3523 (2010) - 2008
- [j5]Gautam Bharali, Olga Holtz:
Functions Preserving Nonnegativity of Matrices. SIAM J. Matrix Anal. Appl. 30(1): 84-101 (2008) - 2007
- [j4]James Demmel, Ioana Dumitriu, Olga Holtz, Robert Kleinberg:
Fast matrix multiplication is stable. Numerische Mathematik 106(2): 199-224 (2007) - [j3]James Demmel, Ioana Dumitriu, Olga Holtz:
Fast linear algebra is stable. Numerische Mathematik 108(1): 59-91 (2007) - 2005
- [j2]Olga Holtz, Amos Ron:
Approximation orders of shift-invariant subspaces of Ws2(Rd). J. Approx. Theory 132(1): 97-148 (2005) - 2004
- [j1]Olga Holtz, Volker Mehrmann, Hans Schneider:
Potter, Wielandt, and Drazin on the Matrix Equation AB = ωBA: New Answers to Old Questions. Am. Math. Mon. 111(8): 655-667 (2004)
Conference and Workshop Papers
- 2022
- [c7]Anthony Chen, James Demmel, Grace Dinh, Mason Haberle, Olga Holtz:
Communication bounds for convolutional neural networks. PASC 2022: 1:1-1:10 - 2015
- [c6]Jacob Scott, Olga Holtz, Oded Schwartz:
Matrix Multiplication I/O-Complexity by Path Routing. SPAA 2015: 35-45 - 2012
- [c5]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication. MedAlg 2012: 13-36 - [c4]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. SPAA 2012: 77-79 - [c3]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Communication-optimal parallel algorithm for strassen's matrix multiplication. SPAA 2012: 193-204 - 2011
- [c2]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Graph expansion and communication costs of fast matrix multiplication: regular submission. SPAA 2011: 1-12 - 2009
- [c1]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Communication-optimal parallel and sequential Cholesky decomposition: extended abstract. SPAA 2009: 245-252
Informal and Other Publications
- 2022
- [i15]Anthony Chen, James Demmel, Grace Dinh, Mason Haberle, Olga Holtz:
Communication Bounds for Convolutional Neural Networks. CoRR abs/2204.08279 (2022) - 2020
- [i14]Gal Beniamini, Nathan Cheng, Olga Holtz, Elaye Karstadt, Oded Schwartz:
Sparsifying the Operators of Fast Matrix Multiplication Algorithms. CoRR abs/2008.03759 (2020) - 2012
- [i13]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication. CoRR abs/1202.3173 (2012) - [i12]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds. CoRR abs/1202.3177 (2012) - [i11]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication. CoRR abs/1209.2184 (2012) - 2011
- [i10]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Graph Expansion and Communication Costs of Fast Matrix Multiplication. CoRR abs/1109.1693 (2011) - 2009
- [i9]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Communication-optimal Parallel and Sequential Cholesky Decomposition. CoRR abs/0902.2537 (2009) - [i8]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Minimizing Communication in Linear Algebra. CoRR abs/0905.2485 (2009) - [i7]Olga Holtz, Noam Shomron:
Computational Complexity and Numerical Stability of Linear Problems. CoRR abs/0906.0687 (2009) - 2008
- [i6]Olga Holtz:
Compressive sensing: a paradigm shift in signal processing. CoRR abs/0812.3137 (2008) - 2007
- [i5]James Demmel, Ioana Dumitriu, Olga Holtz, Plamen Koev:
Accurate and Efficient Expression Evaluation and Linear Algebra. CoRR abs/0712.4027 (2007) - 2006
- [i4]James Demmel, Ioana Dumitriu, Olga Holtz, Robert Kleinberg:
Fast matrix multiplication is stable. CoRR abs/math/0603207 (2006) - [i3]James Demmel, Ioana Dumitriu, Olga Holtz:
Fast linear algebra is stable. CoRR abs/math/0612264 (2006) - 2005
- [i2]James Demmel, Ioana Dumitriu, Olga Holtz:
Toward accurate polynomial evaluation in rounded arithmetic (short report). Algebraic and Numerical Algorithms and Computer-assisted Proofs 2005 - [i1]James Demmel, Ioana Dumitriu, Olga Holtz:
Toward accurate polynomial evaluation in rounded arithmetic. CoRR abs/math/0508350 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
