| Minimizing communication in numerical linear algebra G Ballard, J Demmel, O Holtz, O Schwartz SIAM Journal on Matrix Analysis and Applications 32 (3), 866-901, 2011 | 375 | 2011 |
| A practical randomized CP tensor decomposition C Battaglino, G Ballard, TG Kolda SIAM Journal on Matrix Analysis and Applications 39 (2), 876-901, 2018 | 267 | 2018 |
| Parallel tensor compression for large-scale scientific data W Austin, G Ballard, TG Kolda 2016 IEEE international parallel and distributed processing symposium (IPDPS …, 2016 | 203 | 2016 |
| Communication-optimal parallel algorithm for strassen's matrix multiplication G Ballard, J Demmel, O Holtz, B Lipshitz, O Schwartz Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012 | 177 | 2012 |
| Communication lower bounds and optimal algorithms for numerical linear algebra G Ballard, E Carson, J Demmel, M Hoemmen, N Knight, O Schwartz Acta Numerica 23, 1-155, 2014 | 146 | 2014 |
| Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication A Azad, G Ballard, A Buluc, J Demmel, L Grigori, O Schwartz, S Toledo, ... SIAM Journal on Scientific Computing 38 (6), C624-C651, 2016 | 141 | 2016 |
| Graph expansion and communication costs of fast matrix multiplication G Ballard, J Demmel, O Holtz, O Schwartz Journal of the ACM (JACM) 59 (6), 1-23, 2013 | 135 | 2013 |
| Communication-avoiding QR decomposition for GPUs M Anderson, G Ballard, J Demmel, K Keutzer 2011 IEEE International Parallel & Distributed Processing Symposium, 48-58, 2011 | 135 | 2011 |
| Communication optimal parallel multiplication of sparse random matrices G Ballard, A Buluc, J Demmel, L Grigori, B Lipshitz, O Schwartz, S Toledo Proceedings of the twenty-fifth annual ACM symposium on Parallelism in …, 2013 | 119 | 2013 |
| A framework for practical parallel fast matrix multiplication AR Benson, G Ballard ACM SIGPLAN Notices 50 (8), 42-53, 2015 | 118 | 2015 |
| Communication-optimal parallel and sequential Cholesky decomposition G Ballard, J Demmel, O Holtz, O Schwartz Proceedings of the twenty-first annual symposium on Parallelism in …, 2009 | 92 | 2009 |
| Communication-avoiding parallel Strassen: Implementation and performance G Ballard, J Demmel, B Lipshitz, O Schwartz Proceedings of 2012 International Conference for High Performance Computing …, 0 | 86* | |
| A high-performance parallel algorithm for nonnegative matrix factorization R Kannan, G Ballard, H Park ACM SIGPLAN Notices 51 (8), 1-11, 2016 | 84 | 2016 |
| Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds G Ballard, J Demmel, O Holtz, B Lipshitz, O Schwartz Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and …, 2012 | 83* | 2012 |
| Hypergraph partitioning for sparse matrix-matrix multiplication G Ballard, A Druinsky, N Knight, O Schwartz ACM Transactions on Parallel Computing (TOPC) 3 (3), 1-34, 2016 | 71 | 2016 |
| TuckerMPI: A parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition G Ballard, A Klinvex, TG Kolda ACM Transactions on Mathematical Software (TOMS) 46 (2), 1-31, 2020 | 68 | 2020 |
| Communication-optimal parallel and sequential eigenvalue and singular value algorithms G Ballard, J Demmel, I Dumitriu EECS University of California, Berkeley, CA, USA, Technical Report EECS-2011-14, 2011 | 59* | 2011 |
| Dynamic functional connectivity and individual differences in emotions during social stress MJ Tobia, K Hayashi, G Ballard, IH Gotlib, CE Waugh Human brain mapping 38 (12), 6185-6205, 2017 | 56 | 2017 |
| Improving the numerical stability of fast matrix multiplication G Ballard, AR Benson, A Druinsky, B Lipshitz, O Schwartz SIAM Journal on Matrix Analysis and Applications 37 (4), 1382-1418, 2016 | 55 | 2016 |
| Diamond sampling for approximate maximum all-pairs dot-product (MAD) search G Ballard, TG Kolda, A Pinar, C Seshadhri 2015 IEEE International Conference on Data Mining, 11-20, 2015 | 55 | 2015 |
James W DEMMELProfessor of EECS and Mathematics, UC BerkeleyEmail verificata su berkeley.edu