Nicholas Knight

1. Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication
   2016/03/17 by Grey Ballard, Alex Druinsky, Ballard, Grey +5 · 3 citations
   Computer Science · #Distributed #FOS: Computer and information sciences #Graph Theory and Algorithms #Interconnection Networks and Systems #Parallel #Parallel Computing and Optimization Techniques #and Cluster Computing (cs.DC)
2. Communication lower bounds and optimal algorithms for programs that reference arrays -- Part 1
   2013/08/01 by Michael Christ, James Demmel, Christ, Michael +7 · 2 citations
   Engineering · #26D15 #68W40 #Classical Analysis and ODEs (math.CA) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Sparse and Compressive Sensing Techniques #Topology Optimization in Engineering #VLSI and FPGA Design Techniques
3. Communication Lower Bounds for Matricized Tensor Times Khatri-Rao\n Product
   2017/08/24 by Grey Ballard, Ballard, Grey, Nicholas Knight +3 · 1 citation
   Computer Science · Mathematics · #Distributed #FOS: Computer and information sciences #Interconnection Networks and Systems #Parallel #Parallel Computing and Optimization Techniques #Tensor decomposition and applications #and Cluster Computing (cs.DC)