Follow
Oded Schwartz
Title
Cited by
Cited by
Year
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
3392011
On the complexity of approximating k -set packing
E Hazan, S Safra, O Schwartz
computational complexity 15 (1), 20-39, 2006
1922006
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
1552012
Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication
J Demmel, D Eliahu, A Fox, S Kamil, B Lipshitz, O Schwartz, O Spillinger
Parallel & Distributed Processing (IPDPS), 2013
1422013
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
1292013
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
1282014
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
1022016
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
1022013
Communication-optimal parallel and sequential Cholesky decomposition
G Ballard, J Demmel, O Holtz, O Schwartz
SIAM Journal on Scientific Computing 32 (6), 3495-3523, 2010
872010
Communication-avoiding parallel Strassen: Implementation and performance
G Ballard, J Demmel, B Lipshitz, O Schwartz
Proceedings of 2012 International Conference for High Performance Computing†…, 2012
80*2012
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
74*2012
On the complexity of approximating TSP with neighborhoods and related problems
S Safra, O Schwartz
computational complexity 14 (4), 281-307, 2006
712006
Delay-Doppler channel estimation in almost linear complexity
A Fish, S Gurevich, R Hadani, AM Sayeed, O Schwartz
IEEE Transactions on Information Theory 59 (11), 7632-7644, 2013
662013
An elementary construction of constant-degree expanders
N Alon, O Schwartz, A Shapira
Combinatorics, Probability and Computing 17 (3), 319-327, 2008
582008
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
572016
On the complexity of approximating k-dimensional matching
E Hazan, S Safra, O Schwartz
Approximation, Randomization, and Combinatorial Optimization.. Algorithms†…, 2003
572003
Write-avoiding algorithms
E Carson, J Demmel, L Grigori, N Knight, P Koanantakool, O Schwartz, ...
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS†…, 2016
542016
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
49*2013
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
452016
Quantum expanders: Motivation and constructions
A Ben-Aroya, O Schwartz, A Ta-Shma
2008 23rd Annual IEEE Conference on Computational Complexity, 292-303, 2008
452008
The system can't perform the operation now. Try again later.
Articles 1–20