◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Benjamin Lipshitz

3 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author3

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.DS2
  • cs.IR1
ORCID 0009-0002-1111-5252

identity via Semantic Scholar / OpenAlex

most citedStrong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds

16 citations · 25 across the 3 of their papers we have counts for

collaborators

3 papers

cs.IR2023

Fresh Content Needs More Attention: Multi-funnel Fresh Content Recommendation

Jianling Wang, Haokai Lu, Sai zhang +10

Recommendation system serves as a conduit connecting users to an incredibly large, diverse and ever growing collection of contents. In practice, missing information on fresh (and t…

cs.DS2012★ 16 cited

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

Grey Ballard, James Demmel, Olga Holtz +2

A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for…

cs.DS2012★ 9 cited

Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication

Grey Ballard, James Demmel, Olga Holtz +2

Parallel matrix multiplication is one of the most studied fundamental problems in distributed and high performance computing. We obtain a new parallel algorithm that is based on St…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.