Nicholas Knight

According to our database1, Nicholas Knight authored at least 17 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Multilinear Inequalities of Holder-Brascamp-Lieb Type for Torsion-Free Discrete Abelian Groups.
J. Log. Anal., 2024

2023
Vectorized Nonlinear Functions with the RISC-V Vector Extension.
Proceedings of the 30th IEEE Symposium on Computer Arithmetic, 2023

2018
A 3D Parallel Algorithm for QR Decomposition.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2016
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication.
ACM Trans. Parallel Comput., 2016

Write-Avoiding Algorithms.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015
Communication-Optimal Loop Nests.
PhD thesis, 2015

Avoiding Communication in Successive Band Reduction.
ACM Trans. Parallel Comput., 2015

Reconstructing Householder vectors from Tall-Skinny QR.
J. Parallel Distributed Comput., 2015

Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
Communication lower bounds and optimal algorithms for numerical linear algebra.
Acta Numer., 2014

Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

2013
Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods.
SIAM J. Sci. Comput., 2013

Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1.
CoRR, 2013

Exploiting Data Sparsity in Parallel Matrix Powers Computations.
Proceedings of the Parallel Processing and Applied Mathematics, 2013

2012
Communication avoiding successive band reduction.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012


  Loading...