pith. sign in

Grey Ballard

Identifiers

  • name variant Grey Ballard 0.60 · backfill

Papers (23)

  1. High-Performance Star-M SVD for Big Data Compression cs.DC · 2026 · author #2
  2. Parallel Nonnegative CP Decomposition of Dense Tensors cs.NA · 2018 · author #1
  3. A 3D Parallel Algorithm for QR Decomposition cs.DC · 2018 · author #1
  4. The geometry of rank decompositions of matrix multiplication II: $3\times 3$ matrices cs.CC · 2018 · author #1
  5. Shared Memory Parallelization of MTTKRP for Dense Tensors cs.DC · 2017 · author #2
  6. Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product cs.DC · 2017 · author #1
  7. A Practical Randomized CP Tensor Decomposition cs.NA · 2017 · author #2
  8. MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization cs.DC · 2016 · author #2
  9. A communication-avoiding parallel algorithm for the symmetric eigenvalue problem cs.DC · 2016 · author #2
  10. Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication cs.DC · 2016 · author #1
  11. Parallel Tensor Compression for Large-Scale Scientific Data cs.NA · 2015 · author #2
  12. Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication cs.DC · 2015 · author #2
  13. A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization cs.DC · 2015 · author #2
  14. Improving the numerical stability of fast matrix multiplication cs.NA · 2015 · author #1
  15. Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search cs.SI · 2015 · author #1
  16. A Framework for Practical Parallel Fast Matrix Multiplication cs.DC · 2014 · author #2
  17. Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication cs.DS · 2012 · author #1
  18. Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds cs.DS · 2012 · author #1
  19. Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication cs.DS · 2012 · author #1
  20. Graph Expansion and Communication Costs of Fast Matrix Multiplication cs.DS · 2011 · author #1
  21. Minimizing Communication for Eigenproblems and the Singular Value Decomposition math.NA · 2010 · author #1
  22. Minimizing Communication in Linear Algebra cs.CC · 2009 · author #1
  23. Communication-optimal Parallel and Sequential Cholesky Decomposition cs.NA · 2009 · author #1

Mentions

  • 1409.2908 #2 · backfill · confidence 0.70 Grey Ballard
  • 1209.2184 #1 · backfill · confidence 0.70 Grey Ballard
  • 1202.3177 #1 · backfill · confidence 0.70 Grey Ballard
  • 1202.3173 #1 · backfill · confidence 0.70 Grey Ballard
  • 1109.1693 #1 · backfill · confidence 0.70 Grey Ballard
  • 2605.16058 #2 · arxiv_oai · confidence 0.70 Grey Ballard
  • 1011.3077 #1 · backfill · confidence 0.70 Grey Ballard
  • 0905.2485 #1 · backfill · confidence 0.70 Grey Ballard
  • 0902.2537 #1 · backfill · confidence 0.70 Grey Ballard

Frequent Coauthors