default search action
Nicholas Knight
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Michael Christ, James Demmel, Nicholas Knight, Thomas Scanlon, Katherine A. Yelick:
On Multilinear Inequalities of Holder-Brascamp-Lieb Type for Torsion-Free Discrete Abelian Groups. J. Log. Anal. 16 (2024) - 2023
- [c9]Eric Bavier, Nicholas Knight, Hugues de Lassus Saint-Genies, Eric Love:
Vectorized Nonlinear Functions with the RISC-V Vector Extension. ARITH 2023: 127-130
2010 – 2019
- 2018
- [c8]Grey Ballard, Nicholas Knight, Kathryn Rouse:
Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product. IPDPS 2018: 557-567 - [c7]Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight:
A 3D Parallel Algorithm for QR Decomposition. SPAA 2018: 55-65 - [i4]Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight:
A 3D Parallel Algorithm for QR Decomposition. CoRR abs/1805.05278 (2018) - 2017
- [i3]Grey Ballard, Nicholas Knight, Kathryn Rouse:
Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product. CoRR abs/1708.07401 (2017) - 2016
- [j5]Grey Ballard, Alex Druinsky, Nicholas Knight, Oded Schwartz:
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication. ACM Trans. Parallel Comput. 3(3): 18:1-18:34 (2016) - [c6]Erin C. Carson, James Demmel, Laura Grigori, Nicholas Knight, Penporn Koanantakool, Oded Schwartz, Harsha Vardhan Simhadri:
Write-Avoiding Algorithms. IPDPS 2016: 648-658 - [i2]Grey Ballard, Alex Druinsky, Nicholas Knight, Oded Schwartz:
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication. CoRR abs/1603.05627 (2016) - 2015
- [b1]Nicholas Knight:
Communication-Optimal Loop Nests. University of California, Berkeley, USA, 2015 - [j4]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) - [j3]Grey Ballard, James Demmel, Nicholas Knight:
Avoiding Communication in Successive Band Reduction. ACM Trans. Parallel Comput. 1(2): 11:1-11:37 (2015) - [c5]Grey Ballard, Alex Druinsky, Nicholas Knight, Oded Schwartz:
Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication. SPAA 2015: 86-88 - 2014
- [j2]Grey Ballard, Erin C. Carson, James Demmel, Mark Hoemmen, Nicholas Knight, Oded Schwartz:
Communication lower bounds and optimal algorithms for numerical linear algebra. Acta Numer. 23: 1-155 (2014) - [c4]Samuel Williams, Mike Lijewski, Ann S. Almgren, Brian van Straalen, Erin C. Carson, Nicholas Knight, James Demmel:
s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid. IPDPS 2014: 1149-1158 - [c3]Edgar Solomonik, Erin C. Carson, Nicholas Knight, James Demmel:
Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations. SPAA 2014: 307-318 - 2013
- [j1]Erin C. Carson, Nicholas Knight, James Demmel:
Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods. SIAM J. Sci. Comput. 35(5) (2013) - [c2]Nicholas Knight, Erin C. Carson, James Demmel:
Exploiting Data Sparsity in Parallel Matrix Powers Computations. PPAM (1) 2013: 15-25 - [i1]Michael Christ, James Demmel, Nicholas Knight, Thomas Scanlon, Katherine A. Yelick:
Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1. CoRR abs/1308.0068 (2013) - 2012
- [c1]Grey Ballard, James Demmel, Nicholas Knight:
Communication avoiding successive band reduction. PPoPP 2012: 35-44
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-07-10 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint