No photo of Oded Schwartz

View Scopus Profile

Oded Schwartz

 https://orcid.org/0000-0003-1309-5566
    Calculated based on number of publications stored in Pure and citations from Scopus
    20032024

    Research activity per year

    Search results

    • 2024

      Alternative Basis Matrix Multiplication is Fast and Stable

      Schwartz, O., Toledo, S., Vaknin, N. & Wiernik, G., 2024, Proceedings - 2024 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2024. Institute of Electrical and Electronics Engineers Inc., p. 38-51 14 p. (Proceedings - 2024 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2024).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      1 Scopus citations

    • Fault-Tolerant Parallel Integer Multiplication

      Nissim, R., Schwartz, O. & Spiizer, Y., 17 Jun 2024, SPAA 2024 - Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 207-218 12 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations

    • Minimizing I/O in Toom-Cook Algorithms

      Nissim, R., Schwartz, O. & Spiizer, Y., 2024, Euro-Par 2024: Parallel Processing - 30th European Conference on Parallel and Distributed Processing, Proceedings. Carretero, J., Garcia-Blas, J., Shende, S., Brandic, I., Olcoz, K. & Schreiber, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 59-73 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14803 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Revisiting “Rapid multiplication of rectangular matrices”

      Nissim, R. & Schwartz, O., 2024, In: Research in Mathematics. 11, 1, 2388334.

      Research output: Contribution to journal › Article › peer-review

      Open Access
    • 2023

      Accelerating Distributed Matrix Multiplication with 4-Dimensional Polynomial Codes

      Nissim, R. & Schwartz, O., 2023, SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023. Berry, J., Shmoys, D., Cowen, L. & Naumann, U. (eds.). Society for Industrial and Applied Mathematics Publications, p. 134-146 13 p. (SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations

    • Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications

      Moran, Y. & Schwartz, O., 17 Jun 2023, SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 379-390 12 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      1 Scopus citations

    • PEBBLING GAME AND ALTERNATIVE BASIS FOR HIGH PERFORMANCE MATRIX MULTIPLICATION

      Schwartz, O. & Vaknin, N., 2023, In: SIAM Journal on Scientific Computing. 45, 6, p. 277-303 27 p.

      Research output: Contribution to journal › Article › peer-review

      3 Scopus citations

    • Stragglers in Distributed Matrix Multiplication

      Nissim, R. & Schwartz, O., 2023, Job Scheduling Strategies for Parallel Processing - 26th Workshop, JSSPP 2023, Revised Selected Papers. Klusáček, D., Corbalán, J. & Rodrigo, G. P. (eds.). Springer Science and Business Media Deutschland GmbH, p. 74-96 23 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14283 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation

      Hadas, T. & Schwartz, O., 24 Jul 2023, ISSAC 2023 - Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation. Jeronimo, G. (ed.). Association for Computing Machinery, p. 289-297 9 p. (ACM International Conference Proceeding Series).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      4 Scopus citations
    • 2020

      Fault Tolerance with High Performance for Fast Matrix Multiplication.

      Birnbaum, N., Nissim, R. & Schwartz, O., 2020, CSC 2020. Society for Industrial and Applied Mathematics, p. 106-117 12 p.

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Matrix multiplication, a little faster

      Karstadt, E. & Schwartz, O., Jan 2020, In: Journal of the ACM. 67, 1, 1.

      Research output: Contribution to journal › Article › peer-review

      17 Scopus citations

    • Network Partitioning and Avoidable Contention

      Oltchik, Y. & Schwartz, O., 6 Jul 2020, SPAA 2020 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 563-565 3 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      1 Scopus citations
    • 2019

      Computation of matrix chain products on parallel machines

      Schwartz, O. & Weiss, E., May 2019, Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium, IPDPS 2019. Institute of Electrical and Electronics Engineers Inc., p. 491-500 10 p. 8820783. (Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium, IPDPS 2019).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      3 Scopus citations

    • Faster matrix multiplication via sparse decomposition

      Beniamini, G. & Schwartz, O., 17 Jun 2019, SPAA 2019 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 11-22 12 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      12 Scopus citations

    • Revisiting computation of matrix chain products

      Schwartz, O. & Weiss, E., 2019, In: SIAM Journal on Computing. 48, 5, p. 1481-1486 6 p.

      Research output: Contribution to journal › Article › peer-review

      2 Scopus citations

    • Revisiting the I/O-complexity of fast matrix multiplication with recomputations

      Nissim, R. & Schwartz, O., May 2019, Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium, IPDPS 2019. Institute of Electrical and Electronics Engineers Inc., p. 482-490 9 p. 8820960. (Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium, IPDPS 2019).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      5 Scopus citations
    • 2018

      Efficient evaluation of matrix polynomials

      Hoffman, N., Schwartz, O. & Toledo, S., 2018, Parallel Processing and Applied Mathematics - 12th International Conference, PPAM 2017, Revised Selected Papers. Dongarra, J., Wyrzykowski, R., Karczewski, K. & Deelman, E. (eds.). Springer Verlag, p. 24-35 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10777 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      3 Scopus citations

    • Fault Tolerant Resource Efficient Matrix Multiplication.

      Birnbaum, N. & Schwartz, O., 2018, CSC 2018. Society for Industrial and Applied Mathematics, p. 23-34 12 p.

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • High-performance direct algorithms for computing the sign function of triangular matrices

      Stotland, V., Schwartz, O. & Toledo, S., Mar 2018, In: Numerical Linear Algebra with Applications. 25, 2, e2139.

      Research output: Contribution to journal › Article › peer-review

    • 2017

      Matrix multiplication, a little faster

      Karstadt, E. & Schwartz, O., 24 Jul 2017, SPAA 2017 - Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 101-110 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; vol. Part F129316).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      17 Scopus citations

    • Network Topologies and Inevitable Contention

      Ballard, G., Demmel, J., Gearhart, A., Lipshitz, B., Oltchik, Y., Schwartz, O. & Toledo, S., 23 Jan 2017, Proceedings of COM-HPC 2016: 1st Workshop on Optimization of Communication in HPC Runtime Systems - Held in conjunction with SC 2016: The International Conference for High Performance Computing, Networking, Storage and Analysis. Institute of Electrical and Electronics Engineers Inc., p. 39-52 14 p. 7830490. (Proceedings of COM-HPC 2016: 1st Workshop on Optimization of Communication in HPC Runtime Systems - Held in conjunction with SC 2016: The International Conference for High Performance Computing, Networking, Storage and Analysis).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      3 Scopus citations
    • 2016

      Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication

      Azad, A., Ballard, G., Buluç, A., Demmel, J., Grigori, L., Schwartz, O., Toledo, S. & Williams, S., 2016, In: SIAM Journal on Scientific Computing. 38, 6, p. C624-C651

      Research output: Contribution to journal › Article › peer-review

      Open Access
      78 Scopus citations

    • Hypergraph partitioning for sparse matrix-matrix multiplication

      Ballard, G., Druinsky, A., Knight, N. & Schwartz, O., Dec 2016, In: ACM Transactions on Parallel Computing. 3, 3, p. 1-34 34 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      33 Scopus citations

    • Improving the numerical stability of fast matrix multiplication

      Ballard, G., Benson, A. R., Druinsky, A., Lipshitz, B. & Schwartz, O., 2016, In: SIAM Journal on Matrix Analysis and Applications. 37, 4, p. 1382-1418 37 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      22 Scopus citations

    • Write-Avoiding Algorithms

      Carson, E., Demmel, J., Grigori, L., Knight, N., Koanantakool, P., Schwartz, O. & Simhadri, H. V., 18 Jul 2016, Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016. Institute of Electrical and Electronics Engineers Inc., p. 648-658 11 p. 7516061. (Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      26 Scopus citations
    • 2015

      Brief announcement: Hypergraph partitioning for parallel sparse matrix-matrix multiplication

      Ballard, G., Knight, N., Druinsky, A. & Schwartz, O., 13 Jun 2015, SPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 86-88 3 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; vol. 2015-June).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      20 Scopus citations

    • Matrix multiplication I/O-complexity by path routing

      Scott, J., Holtz, O. & Schwartz, O., 13 Jun 2015, SPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 35-45 11 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; vol. 2015-June).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      17 Scopus citations
    • 2014

      Communication-avoiding symmetric-indefinite factorization

      Ballard, G., Becker, D., Demmel, J., Dongarra, J., Druinsky, A., Peled, I., Schwartz, O., Toledo, S. & Yamazaki, I., 2014, In: SIAM Journal on Matrix Analysis and Applications. 35, 4, p. 1364-1406 43 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      12 Scopus citations

    • Communication costs of Strassen's matrix multiplication

      Ballard, G., Demmel, J., Holtz, O. & Schwartz, O., Feb 2014, In: Communications of the ACM. 57, 2, p. 107-114 8 p.

      Research output: Contribution to journal › Article › peer-review

      11 Scopus citations

    • Communication lower bounds and optimal algorithms for numerical linear algebra

      Ballard, G., Carson, E., Demmel, J., Hoemmen, M., Knight, N. & Schwartz, O., May 2014, In: Acta Numerica. 23, p. 1-155 155 p.

      Research output: Contribution to journal › Article › peer-review

      75 Scopus citations
    • 2013

      Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout

      Ballard, G., Demmel, J., Lipshitz, B., Schwartz, O. & Toledo, S., 2013, SPAA 2013 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 232-240 9 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      9 Scopus citations

    • Communication optimal parallel multiplication of sparse random matrices

      Ballard, G., Buluç, A., Demmel, J., Grigori, L., Lipshitz, B., Schwartz, O. & Toledo, S., 2013, SPAA 2013 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 222-231 10 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      75 Scopus citations

    • Communication-optimal parallel recursive rectangular matrix multiplication

      Demmel, J., Eliahu, D., Fox, A., Kamil, S., Lipshitz, B., Schwartz, O. & Spillinger, O., 2013, p. 261-272. 12 p.

      Research output: Contribution to conference › Paper › peer-review

      Open Access
      93 Scopus citations

    • Delay-doppler channel estimation in almost linear complexity

      Fish, A., Gurevich, S., Hadani, R., Sayeed, A. M. & Schwartz, O., 2013, In: IEEE Transactions on Information Theory. 59, 11, p. 7632-7644 13 p., 6563167.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      58 Scopus citations

    • Implementing a blocked Aasen's algorithm with a dynamic scheduler on multicore architectures

      Ballard, G., Becker, D., Demmel, J., Dongarra, J., Druinsky, A., Peled, I., Schwartz, O., Toledo, S. & Yamazaki, I., 2013, p. 895-907. 13 p.

      Research output: Contribution to conference › Paper › peer-review

      11 Scopus citations

    • Perfect strong scaling using no additional energy

      Demmel, J., Gearhart, A., Lipshitz, B. & Schwartz, O., 2013, p. 649-660. 12 p.

      Research output: Contribution to conference › Paper › peer-review

      Open Access
      21 Scopus citations
    • 2012

      Beating MKL and ScaLAPACK at rectangular matrix multiplication using the BFS/DFS approach

      Demmel, J., Eliahu, D., Fox, A., Kamil, S., Lipshitz, B., Schwartz, O. & Spillinger, O., 2012, Proceedings - 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, SCC 2012. p. 1370 1 p. 6495978. (Proceedings - 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, SCC 2012).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations

    • Brief announcement: Strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds

      Ballard, G., Demmel, J., Holtz, O., Lipshitz, B. & Schwartz, O., 2012, SPAA'12 - Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures. p. 77-79 3 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      43 Scopus citations

    • Communication-avoiding parallel Strassen: Implementation and performance

      Lipshitz, B., Ballard, G., Demmel, J. & Schwartz, O., 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2012. 6468502. (International Conference for High Performance Computing, Networking, Storage and Analysis, SC).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      49 Scopus citations

    • Communication-optimal parallel algorithm for strassen's matrix multiplication

      Ballard, G., Demmel, J., Holtz, O., Lipshitz, B. & Schwartz, O., 2012, SPAA'12 - Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures. p. 193-204 12 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      97 Scopus citations

    • Delay-Doppler channel estimation with almost linear complexity: To Solomon Golomb for the occasion of his 80 birthday mazel tov

      Fish, A., Sayeed, A., Gurevich, S., Hadani, R. & Schwartz, O., 2012, 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. p. 2386-2390 5 p. 6283941. (IEEE International Symposium on Information Theory - Proceedings).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      8 Scopus citations

    • Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication

      Ballard, G., Demmel, J., Holtz, O., Lipshitz, B. & Schwartz, O., 2012, Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings. Even, G. & Rawitz, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 13-36 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7659 LNNS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      11 Scopus citations

    • Graph expansion and communication costs of fast matrix multiplication

      Ballard, G., Demmel, J., Holtz, O. & Schwartz, O., Dec 2012, In: Journal of the ACM. 59, 6, 32.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      64 Scopus citations
    • 2011

      Colorful Strips

      Aloupis, G., Cardinal, J., Collette, S., Imahori, S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S. & Taslakian, P., May 2011, In: Graphs and Combinatorics. 27, 3, p. 327-339 13 p.

      Research output: Contribution to journal › Article › peer-review

      6 Scopus citations

    • Graph expansion and communication costs of fast matrix multiplication: Regular submission

      Ballard, G., Demmel, J., Holtz, O. & Schwartz, O., 2011, SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures. p. 1-11 11 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      22 Scopus citations

    • Minimizing communication in numerical linear algebra

      Ballard, G., Demmel, J., Holtz, O. & Schwartz, O., 2011, In: SIAM Journal on Matrix Analysis and Applications. 32, 3, p. 866-901 36 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      169 Scopus citations
    • 2010

      Colorful strips

      Aloupis, G., Cardinal, J., Collette, S., Imahori, S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S. & Taslakian, P., 2010, LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings. p. 2-13 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6034 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      1 Scopus citations

    • Communication-optimal parallel and sequential Cholesky decomposition

      Ballard, G., Demmel, J., Holtz, O. & Schwartz, O., 2010, In: SIAM Journal on Scientific Computing. 32, 6, p. 3495-3523 29 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      29 Scopus citations

    • Cooperative TSP

      Armon, A., Avidor, A. & Schwartz, O., 28 Jun 2010, In: Theoretical Computer Science. 411, 31-33, p. 2847-2863 17 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      2 Scopus citations

    • Quantum Expanders: Motivation and Construction.

      Ben-Aroya, A., Schwartz, O. & Ta-Shma, A., 2010, In: Theory of Computing. 6, 1, p. 47-79 33 p., 1.

      Research output: Contribution to journal › Article › peer-review

      Open Access
    Your message has successfully been sent.
    Your message was not sent due to an error.