default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Lipshitz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Yi Su
, Xiangyu Wang, Elaine Ya Le, Liang Liu, Yuening Li, Haokai Lu, Benjamin Lipshitz, Sriraj Badam, Lukasz Heldt, Shuchao Bi, Ed H. Chi, Cristos Goodrow, Su-Lin Wu, Lexi Baugher, Minmin Chen:
Long-Term Value of Exploration: Measurements, Findings and Algorithms. WSDM 2024: 636-644- 2023
- [c11]Jianling Wang, Haokai Lu, Sai Zhang, Bart N. Locanthi, Haoting Wang, Dylan Greaves, Benjamin Lipshitz, Sriraj Badam, Ed H. Chi, Cristos J. Goodrow, Su-Lin Wu, Lexi Baugher, Minmin Chen:
Fresh Content Needs More Attention: Multi-funnel Fresh Content Recommendation. KDD 2023: 5082-5091 - [i7]Yi Su, Xiangyu Wang, Elaine Ya Le, Liang Liu, Yuening Li, Haokai Lu, Benjamin Lipshitz, Sriraj Badam, Lukasz Heldt, Shuchao Bi, Ed H. Chi, Cristos Goodrow, Su-Lin Wu, Lexi Baugher, Minmin Chen:
Value of Exploration: Measurements, Findings and Algorithms. CoRR abs/2305.07764 (2023) - [i6]Jianling Wang, Haokai Lu, Sai Zhang, Bart N. Locanthi, Haoting Wang, Dylan Greaves, Benjamin Lipshitz, Sriraj Badam, Ed H. Chi, Cristos Goodrow, Su-Lin Wu, Lexi Baugher, Minmin Chen:
Fresh Content Needs More Attention: Multi-funnel Fresh Content Recommendation. CoRR abs/2306.01720 (2023)
2010 – 2019
- 2016
- [j1]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) - [c10]Grey Ballard, James Demmel, Andrew Gearhart, Benjamin Lipshitz, Yishai Oltchik, Oded Schwartz, Sivan Toledo:
Network Topologies and Inevitable Contention. COMHPC@SC 2016: 39-52 - 2015
- [i5]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) - 2013
- [c9]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 - [c8]James Demmel, Andrew Gearhart, Benjamin Lipshitz, Oded Schwartz:
Perfect Strong Scaling Using No Additional Energy. IPDPS 2013: 649-660 - [c7]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 - [c6]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 - [i4]Christopher J. Paciorek, Benjamin Lipshitz, Wei Zhuo, Prabhat, Cari Kaufman, Rollin C. Thomas:
Parallelizing Gaussian Process Calculations in R. CoRR abs/1305.4886 (2013) - 2012
- [c5]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 - [c4]Benjamin Lipshitz, Grey Ballard, James Demmel, Oded Schwartz:
Communication-avoiding parallel strassen: implementation and performance. SC 2012: 101 - [c3]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 - [c2]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 - [c1]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Communication-optimal parallel algorithm for strassen's matrix multiplication. SPAA 2012: 193-204 - [i3]Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz:
Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication. CoRR abs/1202.3173 (2012) - [i2]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) - [i1]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)
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-04-24 22:50 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:
