Benjamin Lipshitz

Orcid: 0009-0002-1111-5252

According to our database1, Benjamin Lipshitz authored at least 17 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Long-Term Value of Exploration: Measurements, Findings and Algorithms.
Proceedings of the 17th ACM International Conference on Web Search and Data Mining, 2024

2023
Value of Exploration: Measurements, Findings and Algorithms.
CoRR, 2023

Fresh Content Needs More Attention: Multi-funnel Fresh Content Recommendation.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

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

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

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

2013
Parallelizing Gaussian Process Calculations in R
CoRR, 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

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


  Loading...