◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Hoeven

9 papers hereh-index 272.8k citations203 works total

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

author position
  • first author1
  • middle author3
  • last author5

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

fields
  • math.LO4
  • cs.SC3
  • cs.CC1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

activity
20092025
most citedOn the bit-complexity of sparse polynomial multiplication

11 citations · 26 across the 8 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

cs.CC2025

Integer multiplication is at least as hard as matrix transposition

David Harvey, Joris van der Hoeven

Working in the multitape Turing model, we show how to reduce the problem of matrix transposition to the problem of integer multiplication. If transposing an n×n binary mat…

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