default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOded Schwartz
Person information
- affiliation: The Hebrew University of Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c38]Roy Nissim
, Oded Schwartz, Yuval Spiizer:
Minimizing I/O in Toom-Cook Algorithms. Euro-Par (3) 2024: 59-73- [c37]Oded Schwartz, Sivan Toledo, Noa Vaknin, Gal Wiernik:
Alternative Basis Matrix Multiplication is Fast and Stable. IPDPS 2024: 38-51 - [c36]Roy Nissim, Oded Schwartz, Yuval Spiizer:
Fault-Tolerant Parallel Integer Multiplication. SPAA 2024: 207-218 - 2023
- [j20]Oded Schwartz, Noa Vaknin:
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication. SIAM J. Sci. Comput. 45(6): 277-303 (2023) - [c35]Roy Nissim, Oded Schwartz:
Accelerating Distributed Matrix Multiplication with 4-Dimensional Polynomial Codes. ACDA 2023: 134-146 - [c34]Tor Hadas, Oded Schwartz:
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation. ISSAC 2023: 289-297 - [c33]Roy Nissim, Oded Schwartz:
Stragglers in Distributed Matrix Multiplication. JSSPP 2023: 74-96 - [c32]Yoav Moran, Oded Schwartz:
Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications. SPAA 2023: 379-390 - 2020
- [j19]Elaye Karstadt, Oded Schwartz:
Matrix Multiplication, a Little Faster. J. ACM 67(1): 1:1-1:31 (2020) - [c31]Noam Birnbaum, Roy Nissim, Oded Schwartz:
Fault Tolerance with High Performance for Fast Matrix Multiplication. CSC 2020: 106-117 - [c30]Yishai Oltchik, Oded Schwartz:
Network Partitioning and Avoidable Contention. SPAA 2020: 563-565 - [i17]Yishai Oltchik, Oded Schwartz:
Network Partitioning and Avoidable Contention. CoRR abs/2005.14150 (2020) - [i16]Gal Beniamini, Nathan Cheng, Olga Holtz, Elaye Karstadt, Oded Schwartz:
Sparsifying the Operators of Fast Matrix Multiplication Algorithms. CoRR abs/2008.03759 (2020)
2010 – 2019
- 2019
- [j18]Oded Schwartz, Elad Weiss:
Revisiting "Computation of Matrix Chain Products". SIAM J. Comput. 48(5): 1481-1486 (2019) - [c29]Roy Nissim, Oded Schwartz:
Revisiting the I/O-Complexity of Fast Matrix Multiplication with Recomputations. IPDPS 2019: 482-490 - [c28]Elad Weiss, Oded Schwartz:
Computation of Matrix Chain Products on Parallel Machines. IPDPS 2019: 491-500 - [c27]Gal Beniamini, Oded Schwartz:
Faster Matrix Multiplication via Sparse Decomposition. SPAA 2019: 11-22 - 2018
- [j17]Vadim Stotland, Oded Schwartz, Sivan Toledo:
High-performance direct algorithms for computing the sign function of triangular matrices. Numer. Linear Algebra Appl. 25(2) (2018) - [c26]Noam Birnbaum, Oded Schwartz:
Fault Tolerant Resource Efficient Matrix Multiplication. CSC 2018: 23-34 - 2017
- [c25]Niv Hoffman, Oded Schwartz, Sivan Toledo:
Efficient Evaluation of Matrix Polynomials. PPAM (1) 2017: 24-35 - [c24]Elaye Karstadt, Oded Schwartz:
Matrix Multiplication, a Little Faster. SPAA 2017: 101-110 - 2016
- [j16]Grey Ballard, Austin R. Benson, Alex Druinsky, Benjamin Lipshitz, Oded Schwartz:
Improving the Numerical Stability of Fast Matrix Multiplication. SIAM J. Matrix Anal. Appl. 37(4): 1382-1418 (2016) - [j15]Ariful Azad, Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Oded Schwartz, Sivan Toledo, Samuel Williams:
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication. SIAM J. Sci. Comput. 38(6) (2016) - [j14]Grey Ballard, Alex Druinsky, Nicholas Knight, Oded Schwartz:
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication. ACM Trans. Parallel Comput. 3(3): 18:1-18:34 (2016) - [c23]Erin C. Carson, James Demmel, Laura Grigori, Nicholas Knight, Penporn Koanantakool, Oded Schwartz, Harsha Vardhan Simhadri:
Write-Avoiding Algorithms. IPDPS 2016: 648-658 - [c22]Grey Ballard, James Demmel, Andrew Gearhart, Benjamin Lipshitz, Yishai Oltchik, Oded Schwartz, Sivan Toledo:
Network Topologies and Inevitable Contention. COMHPC@SC 2016: 39-52 - [i15]Grey Ballard, Alex Druinsky, Nicholas Knight, Oded Schwartz:
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication. CoRR abs/1603.05627 (2016) - [i14]Vadim Stotland, Oded Schwartz, Sivan Toledo:
High-Performance Algorithms for Computing the Sign Function of Triangular Matrices. CoRR abs/1607.06303 (2016) - 2015
- [c21]Jacob Scott, Olga Holtz, Oded Schwartz:
Matrix Multiplication I/O-Complexity by Path Routing. SPAA 2015: 35-45 - [c20]Grey Ballard, Alex Druinsky, Nicholas Knight, Oded Schwartz:
Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication. SPAA 2015: 86-88 - [i13]Grey Ballard, Austin R. Benson, Alex Druinsky, Benjamin Lipshitz, Oded Schwartz:
Improving the numerical stability of fast matrix multiplication algorithms. CoRR abs/1507.00687 (2015) - [i12]Ariful Azad, Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Oded Schwartz, Sivan Toledo, Samuel Williams:
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication. CoRR abs/1510.00844 (2015) - 2014
- [j13]Grey Ballard, Erin C. Carson, James Demmel, Mark Hoemmen, Nicholas Knight, Oded Schwartz:
Communication lower bounds and optimal algorithms for numerical linear algebra. Acta Numer. 23: 1-155 (2014) - [j12]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Communication costs of Strassen's matrix multiplication. Commun. ACM 57(2): 107-114 (2014) - [j11]Grey Ballard, Dulceneia Becker, James Demmel, Jack J. Dongarra, Alex Druinsky, Inon Peled, Oded Schwartz, Sivan Toledo, Ichitaro Yamazaki:
Communication-Avoiding Symmetric-Indefinite Factorization. SIAM J. Matrix Anal. Appl. 35(4): 1364-1406 (2014) - 2013
- [j10]Alexander Fish, Shamgar Gurevich, Ronny Hadani, Akbar M. Sayeed, Oded Schwartz:
Delay-Doppler Channel Estimation in Almost Linear Complexity. IEEE Trans. Inf. Theory 59(11): 7632-7644 (2013) - [c19]James Demmel, David Eliahu, Armando Fox, Shoaib Kamil, Benjamin Lipshitz, Oded Schwartz, Omer Spillinger:
Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. IPDPS 2013: 261-272 - [c18]James Demmel, Andrew Gearhart, Benjamin Lipshitz, Oded Schwartz:
Perfect Strong Scaling Using No Additional Energy. IPDPS 2013: 649-660 - [c17]Grey Ballard, Dulceneia Becker, James Demmel, Jack J. Dongarra, Alex Druinsky, Inon Peled, Oded Schwartz, Sivan Toledo, Ichitaro Yamazaki:
Implementing a Blocked Aasen's Algorithm with a Dynamic Scheduler on Multicore Architectures. IPDPS 2013: 895-907 - [c16]Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo:
Communication optimal parallel multiplication of sparse random matrices. SPAA 2013: 222-231 - [c15]Grey Ballard, James Demmel, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo:
Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout. SPAA 2013: 232-240 - 2012
- [j9]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Graph expansion and communication costs of fast matrix multiplication. J. ACM 59(6): 32:1-32:23 (2012) - [c14]Alexander Fish, Akbar M. Sayeed, Shamgar Gurevich, Ronny Hadani, Oded Schwartz:
Delay-Doppler channel estimation with almost linear complexity: To Solomon Golomb for the occasion of his 80 birthday mazel tov. ISIT 2012: 2386-2390 - [c13]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication. MedAlg 2012: 13-36 - [c12]Benjamin Lipshitz, Grey Ballard, James Demmel, Oded Schwartz:
Communication-avoiding parallel strassen: implementation and performance. SC 2012: 101 - [c11]James Demmel, David Eliahu, Armando Fox, Shoaib Kamil, Benjamin Lipshitz, Oded Schwartz, Omer Spillinger:
Poster: Beating MKL and ScaLAPACK at Rectangular Matrix Multiplication Using the BFS/DFS Approach. SC Companion 2012: 1370 - [c10]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. SPAA 2012: 77-79 - [c9]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Communication-optimal parallel algorithm for strassen's matrix multiplication. SPAA 2012: 193-204 - [i11]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication. CoRR abs/1202.3173 (2012) - [i10]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds. CoRR abs/1202.3177 (2012) - [i9]Alexander Fish, Shamgar Gurevich, Ronny Hadani, Akbar M. Sayeed, Oded Schwartz:
Delay-Doppler Channel Estimation with Almost Linear Complexity. CoRR abs/1208.4405 (2012) - [i8]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication. CoRR abs/1209.2184 (2012) - 2011
- [j8]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. Graphs Comb. 27(3): 327-339 (2011) - [j7]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Minimizing Communication in Numerical Linear Algebra. SIAM J. Matrix Anal. Appl. 32(3): 866-901 (2011) - [c8]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Graph expansion and communication costs of fast matrix multiplication: regular submission. SPAA 2011: 1-12 - [i7]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Graph Expansion and Communication Costs of Fast Matrix Multiplication. CoRR abs/1109.1693 (2011) - [i6]Alexander Fish, Shamgar Gurevich, Ronny Hadani, Akbar M. Sayeed, Oded Schwartz:
Computing the Matched Filter in Linear Time. CoRR abs/1112.4883 (2011) - 2010
- [j6]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Communication-optimal Parallel and Sequential Cholesky Decomposition. SIAM J. Sci. Comput. 32(6): 3495-3523 (2010) - [j5]Amitai Armon, Adi Avidor, Oded Schwartz:
Cooperative TSP. Theor. Comput. Sci. 411(31-33): 2847-2863 (2010) - [j4]Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma:
Quantum Expanders: Motivation and Construction. Theory Comput. 6(1): 47-79 (2010) - [c7]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. LATIN 2010: 2-13
2000 – 2009
- 2009
- [c6]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Communication-optimal parallel and sequential Cholesky decomposition: extended abstract. SPAA 2009: 245-252 - [i5]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Communication-optimal Parallel and Sequential Cholesky Decomposition. CoRR abs/0902.2537 (2009) - [i4]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. CoRR abs/0904.2115 (2009) - [i3]Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Minimizing Communication in Linear Algebra. CoRR abs/0905.2485 (2009) - 2008
- [j3]Noga Alon, Oded Schwartz, Asaf Shapira:
An Elementary Construction of Constant-Degree Expanders. Comb. Probab. Comput. 17(3): 319-327 (2008) - [c5]Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma:
Quantum Expanders: Motivation and Constructions. CCC 2008: 292-303 - 2007
- [b1]Oded Schwartz:
Expansion and approximability. Tel Aviv University, Israel, 2007 - [c4]Noga Alon, Oded Schwartz, Asaf Shapira:
An elementary construction of constant-degree expanders. SODA 2007: 454-458 - 2006
- [j2]Shmuel Safra, Oded Schwartz:
On the complexity of approximating tsp with neighborhoods and related problems. Comput. Complex. 14(4): 281-307 (2006) - [j1]Elad Hazan, Shmuel Safra, Oded Schwartz:
On the complexity of approximating k-set packing. Comput. Complex. 15(1): 20-39 (2006) - [c3]Amitai Armon, Adi Avidor, Oded Schwartz:
Cooperative TSP. ESA 2006: 40-51 - [i2]Noga Alon, Oded Schwartz, Asaf Shapira:
An Elementary Construction of Constant-Degree Expanders. Electron. Colloquium Comput. Complex. TR06 (2006) - 2003
- [c2]Shmuel Safra, Oded Schwartz:
On the Complexity of Approximating TSP with Neighborhoods and Related Problems. ESA 2003: 446-458 - [c1]Elad Hazan, Shmuel Safra, Oded Schwartz:
On the Complexity of Approximating k-Dimensional Matching. RANDOM-APPROX 2003: 83-97 - [i1]Elad Hazan, Shmuel Safra, Oded Schwartz:
On the Hardness of Approximating k-Dimensional Matching. Electron. Colloquium Comput. Complex. TR03 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
