◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Demmel

48 papers hereh-index 7333k citations385 works total

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

author position
  • first author6
  • middle author30
  • last author12

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

fields
  • cs.DC14
  • cs.LG9
  • cs.DS7
  • math.NA7
  • math.OC6
  • math.CA2
same name
  • J. Demmel — 12 papers, h 24
  • J. Demmel — 2 papers, h 3
  • J. Demmel — 1 paper, h 7

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20042023
most citedMinimizing Communication in Linear Algebra

282 citations · 1k across the 43 of their papers we have counts for

collaborators
Showing 2017 · cs.DCShow all

4 papers · 2 filters

cs.DC2017

Avoiding Synchronization in First-Order Methods for Sparse Convex Optimization

Aditya Devarakonda, Kimon Fountoulakis, James Demmel +1

Parallel computing has played an important role in speeding up convex optimization methods for big data analytics and large-scale machine learning (ML). However, the scalability of…

cs.DC2017★ 3 cited

Avoiding Communication in Proximal Methods for Convex Optimization Problems

Saeed Soori, Aditya Devarakonda, James Demmel +2

The fast iterative soft thresholding algorithm (FISTA) is used to solve convex regularized optimization problems in machine learning. Distributed implementations of the algorithm h…

cs.DC2017★ 71 cited

Scaling Deep Learning on GPU and Knights Landing clusters

Yang You, Aydin Buluc, James Demmel

The speed of deep neural networks training has become a big bottleneck of deep learning research and development. For example, training GoogleNet by ImageNet dataset on one Nvidia…

cs.DC2017

Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions

Edgar Solomonik, James Demmel, Torsten Hoefler

We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for…

◍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.