Seguir
Oded Schwartz
Título
Citado por
Citado por
Año
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
3752011
On the complexity of approximating k -set packing
E Hazan, S Safra, O Schwartz
computational complexity 15 (1), 20-39, 2006
2122006
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
1782012
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
1602013
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
1472014
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
1412016
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
1352013
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
1192013
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
922010
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
87*2012
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
852013
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
On the complexity of approximating TSP with neighborhoods and related problems
S Safra, O Schwartz
computational complexity 14 (4), 281-307, 2006
762006
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
722016
An elementary construction of constant-degree expanders
N Alon, O Schwartz, A Shapira
Combinatorics, Probability and Computing 17 (3), 319-327, 2008
632008
On the complexity of approximating k-dimensional matching
E Hazan, S Safra, O Schwartz
Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003
602003
Matrix Multiplication, a Little Faster
E Karstadt, O Schwartz
Journal of the ACM (JACM) 67 (1), 1-31, 2020
592020
Quantum expanders: Motivation and constructions
A Ben-Aroya, O Schwartz, A Ta-Shma
2008 23rd Annual IEEE Conference on Computational Complexity, 292-303, 2008
572008
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
56*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
552016
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20