Остановите войну!
for scientists:
default search action
James Demmel
- > Home > Persons > James Demmel
Publications
- 2023
- [j89]James Demmel, Laura Grigori, Alexander Rusciano:
An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation. SIAM J. Matrix Anal. Appl. 44(2): 559-591 (2023) - [c112]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Laura Grigori, Aydin Buluç, James Demmel:
Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition. NeurIPS 2023 - [i54]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Laura Grigori, Aydin Buluç, James Demmel:
Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition. CoRR abs/2301.12584 (2023) - [i53]Riley Murray, James Demmel, Michael W. Mahoney, N. Benjamin Erichson, Maksim Melnichenko, Osman Asif Malik, Laura Grigori, Piotr Luszczek, Michal Derezinski, Miles E. Lopes, Tianyu Liang, Hengrui Luo, Jack J. Dongarra:
Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software. CoRR abs/2302.11474 (2023) - 2021
- [j86]Swapnil Das, James Demmel, Kimon Fountoulakis, Laura Grigori, Michael W. Mahoney, Shenghao Yang:
Parallel and Communication Avoiding Least Angle Regression. SIAM J. Sci. Comput. 43(2): C154-C176 (2021) - 2019
- [i34]Swapnil Das, Jim Demmel, Kimon Fountoulakis, Laura Grigori, Michael W. Mahoney:
Parallel and Communication Avoiding Least Angle Regression. CoRR abs/1905.11340 (2019) - [i31]James Demmel, Laura Grigori, Alexander Rusciano:
An improved analysis and unified perspective on deterministic and randomized low rank matrix approximations. CoRR abs/1910.00223 (2019) - 2018
- [j79]Laura Grigori, Sébastien Cayrols, James Weldon Demmel:
Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting. SIAM J. Sci. Comput. 40(2) (2018) - [c91]Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight:
A 3D Parallel Algorithm for QR Decomposition. SPAA 2018: 55-65 - [i27]Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight:
A 3D Parallel Algorithm for QR Decomposition. CoRR abs/1805.05278 (2018) - 2016
- [j76]Ariful Azad, Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Oded Schwartz, Sivan Toledo, Samuel Williams:
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication. SIAM J. Sci. Comput. 38(6) (2016) - [c85]Erin C. Carson, James Demmel, Laura Grigori, Nicholas Knight, Penporn Koanantakool, Oded Schwartz, Harsha Vardhan Simhadri:
Write-Avoiding Algorithms. IPDPS 2016: 648-658 - 2015
- [j75]Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight, Hong Diep Nguyen:
Reconstructing Householder vectors from Tall-Skinny QR. J. Parallel Distributed Comput. 85: 3-31 (2015) - [j74]James Demmel, Laura Grigori, Ming Gu, Hua Xiang:
Communication Avoiding Rank Revealing QR Factorization with Column Pivoting. SIAM J. Matrix Anal. Appl. 36(1): 55-89 (2015) - [i17]Ariful Azad, Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Oded Schwartz, Sivan Toledo, Samuel Williams:
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication. CoRR abs/1510.00844 (2015) - 2014
- [c77]Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Hong Diep Nguyen, Edgar Solomonik:
Reconstructing Householder Vectors from Tall-Skinny QR. IPDPS 2014: 1159-1170 - 2013
- [j65]Amal Khabou, James Demmel, Laura Grigori, Ming Gu:
LU Factorization with Panel Rank Revealing Pivoting and Its Communication Avoiding Version. SIAM J. Matrix Anal. Appl. 34(3): 1401-1429 (2013) - [c63]Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo:
Communication optimal parallel multiplication of sparse random matrices. SPAA 2013: 222-231 - 2012
- [j62]James Demmel, Laura Grigori, Mark Hoemmen, Julien Langou:
Communication-optimal Parallel and Sequential QR and LU Factorizations. SIAM J. Sci. Comput. 34(1) (2012) - [i12]Amal Khabou, James Demmel, Laura Grigori, Ming Gu:
LU factorization with panel rank revealing pivoting and its communication avoiding version. CoRR abs/1208.2451 (2012) - 2011
- [j59]Laura Grigori, James Demmel, Hua Xiang:
CALU: A Communication Optimal LU Factorization Algorithm. SIAM J. Matrix Anal. Appl. 32(4): 1317-1350 (2011) - [r2]Xiaoye Sherry Li, James Demmel, John R. Gilbert, Laura Grigori, Meiyue Shao:
SuperLU. Encyclopedia of Parallel Computing 2011: 1955-1962 - 2010
- [c42]Laura Grigori, Pierre-Yves David, James Demmel, Sylvain Peyronnet:
Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem. SPAA 2010: 79-81 - 2008
- [c38]Laura Grigori, James Demmel, Hua Xiang:
Communication avoiding Gaussian elimination. SC 2008: 29 - [i6]James Demmel, Laura Grigori, Mark Hoemmen, Julien Langou:
Communication-avoiding parallel and sequential QR factorizations. CoRR abs/0806.2159 (2008) - 2007
- [j44]Laura Grigori, James Demmel, Xiaoye S. Li:
Parallel Symbolic Factorization for Sparse LU with Static Pivoting. SIAM J. Sci. Comput. 29(3): 1289-1314 (2007)
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-03-03 02:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint