Oded Schwartz

According to our database1, Oded Schwartz authored at least 52 papers between 2003 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Matrix Multiplication, a Little Faster.
J. ACM, 2020

Sparsifying the Operators of Fast Matrix Multiplication Algorithms.
CoRR, 2020

Network Partitioning and Avoidable Contention.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Fault Tolerance with High Performance for Fast Matrix Multiplication.
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

2019
Revisiting "Computation of Matrix Chain Products".
SIAM J. Comput., 2019

Faster Matrix Multiplication via Sparse Decomposition.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Computation of Matrix Chain Products on Parallel Machines.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Revisiting the I/O-Complexity of Fast Matrix Multiplication with Recomputations.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

2018
High-performance direct algorithms for computing the sign function of triangular matrices.
Numer. Linear Algebra Appl., 2018

Fault Tolerant Resource Efficient Matrix Multiplication.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

2017
Efficient Evaluation of Matrix Polynomials.
Proceedings of the Parallel Processing and Applied Mathematics, 2017

2016
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication.
ACM Trans. Parallel Comput., 2016

Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication.
SIAM J. Sci. Comput., 2016

Improving the Numerical Stability of Fast Matrix Multiplication.
SIAM J. Matrix Anal. Appl., 2016

High-Performance Algorithms for Computing the Sign Function of Triangular Matrices.
CoRR, 2016

Network Topologies and Inevitable Contention.
Proceedings of the First International Workshop on Communication Optimizations in HPC, 2016

Write-Avoiding Algorithms.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015
Improving the numerical stability of fast matrix multiplication algorithms.
CoRR, 2015

Matrix Multiplication I/O-Complexity by Path Routing.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
Communication-Avoiding Symmetric-Indefinite Factorization.
SIAM J. Matrix Anal. Appl., 2014

Communication costs of Strassen's matrix multiplication.
Commun. ACM, 2014

Communication lower bounds and optimal algorithms for numerical linear algebra.
Acta Numer., 2014

2013
Delay-Doppler Channel Estimation in Almost Linear Complexity.
IEEE Trans. Inf. Theory, 2013

Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Communication optimal parallel multiplication of sparse random matrices.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Perfect Strong Scaling Using No Additional Energy.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Implementing a Blocked Aasen's Algorithm with a Dynamic Scheduler on Multicore Architectures.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2012
Graph expansion and communication costs of fast matrix multiplication.
J. ACM, 2012

Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
CoRR, 2012

Communication-optimal parallel algorithm for strassen's matrix multiplication.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Communication-avoiding parallel strassen: implementation and performance.
Proceedings of the SC Conference on High Performance Computing Networking, 2012

Poster: Beating MKL and ScaLAPACK at Rectangular Matrix Multiplication Using the BFS/DFS Approach.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication.
Proceedings of the Design and Analysis of Algorithms, 2012

Delay-Doppler channel estimation with almost linear complexity: To Solomon Golomb for the occasion of his 80 birthday mazel tov.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Minimizing Communication in Numerical Linear Algebra.
SIAM J. Matrix Anal. Appl., 2011

Colorful Strips.
Graphs Comb., 2011

Computing the Matched Filter in Linear Time
CoRR, 2011

Graph expansion and communication costs of fast matrix multiplication: regular submission.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010
Quantum Expanders: Motivation and Construction.
Theory Comput., 2010

Cooperative TSP.
Theor. Comput. Sci., 2010

Communication-optimal Parallel and Sequential Cholesky Decomposition.
SIAM J. Sci. Comput., 2010

2009
Minimizing Communication in Linear Algebra
CoRR, 2009

Communication-optimal parallel and sequential Cholesky decomposition: extended abstract.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008
An Elementary Construction of Constant-Degree Expanders.
Comb. Probab. Comput., 2008

Quantum Expanders: Motivation and Constructions.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2006
On the complexity of approximating tsp with neighborhoods and related problems.
Comput. Complex., 2006

On the complexity of approximating <i>k</i>-set packing.
Comput. Complex., 2006

2003
On the Hardness of Approximating k-Dimensional Matching
Electron. Colloquium Comput. Complex., 2003

On the Complexity of Approximating k-Dimensional Matching.
Proceedings of the Approximation, 2003


  Loading...