Benjamin Lipshitz
Benjamin Lipshitz
Unknown affiliation
Verified email at cs.berkeley.edu
Title
Cited by
Cited by
Year
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
1302012
Communication-optimal parallel recursive rectangular matrix multiplication
J Demmel, D Eliahu, A Fox, S Kamil, B Lipshitz, O Schwartz, O Spillinger
2013 IEEE 27th International Symposium on Parallel and Distributed …, 2013
1002013
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
922013
Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds
G Ballard, J Demmel, O Holtz, B Lipshitz, O Schwartz
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
70*2012
Communication-avoiding parallel strassen: Implementation and performance
B Lipshitz, G Ballard, J Demmel, O Schwartz
SC'12: Proceedings of the International Conference on High Performance …, 2012
642012
Perfect strong scaling using no additional energy
J Demmel, A Gearhart, B Lipshitz, O Schwartz
2013 IEEE 27th International Symposium on Parallel and Distributed …, 2013
382013
Graph expansion analysis for communication costs of fast rectangular matrix multiplication
G Ballard, J Demmel, O Holtz, B Lipshitz, O Schwartz
Mediterranean Conference on Algorithms, 13-36, 2012
302012
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
292016
Parallelizing gaussian process calculations in r
CJ Paciorek, B Lipshitz, W Zhuo, CG Kaufman, RC Thomas
arXiv preprint arXiv:1305.4886, 2013
262013
Communication efficient Gaussian elimination with partial pivoting using a shape morphing data layout
G Ballard, J Demmel, B Lipshitz, O Schwartz, S Toledo
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in …, 2013
172013
Network topologies and inevitable contention
G Ballard, J Demmel, A Gearhart, B Lipshitz, Y Oltchik, O Schwartz, ...
2016 First International Workshop on Communication Optimizations in HPC …, 2016
72016
Communication-avoiding linear-algebraic primitives for graph analytics
A Buluç, G Ballard, J Demmel, J Gilbert, L Grigori, B Lipshitz, A Lugowski, ...
International Parallel and Distributed Processing Symposium Workshops …, 2014
52014
Communication-avoiding parallel recursive algorithms for matrix multiplication
B Lipshitz
CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE, 2013
52013
Lower bounds on algorithm energy consumption: Current work and future directions
J Demmel, A Gearhart, B Lipshitz, O Schwartz
SIAM Conference on Computational Science & Engineering, Challenges of Energy …, 2013
52013
Poster: Beating mkl and scalapack at rectangular matrix multiplication using the bfs/dfs approach
J Demmel, D Eliahu, A Fox, S Kamil, B Lipshitz, O Schwartz, O Spillinger
2012 SC Companion: High Performance Computing, Networking Storage and …, 2012
42012
Contention Bounds for Combinations of Computation Graphs and Network Topologies.
GM Ballard, J Demmel, A Gearhart, B Lipshitz, O Schwartz, S Toledo
Sandia National Lab.(SNL-CA), Livermore, CA (United States), 2015
22015
Package ‘bigGP’
C Paciorek, B Lipshitz, C Kaufman, T Zhuo, R Thomas, MC Paciorek
2015
Communication-Avoiding Parallel Recursive Algorithms for Matrix
B Lipshitz
University of California, Berkeley Spring 2013., 2013
2013
The system can't perform the operation now. Try again later.
Articles 1–18