◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nathan Wallheimer

7 papers hereh-index 214 citations7 works total

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

author position
  • middle author1
  • last author6

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

fields
  • cs.DS7

identity via Semantic Scholar / OpenAlex

activity
20222026
collaborators
Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Recognizing Sumsets is NP-Complete

Amir Abboud, Nick Fischer, Ron Safier +1

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set S is a sumset, i.e. whether there is a s…

cs.DS2024

Worst-Case to Expander-Case Reductions: Derandomized and Generalized

Amir Abboud, Nathan Wallheimer

A recent paper by Abboud and Wallheimer [ITCS 2023] presents self-reductions for various fundamental graph problems, which transform worst-case instances to expanders, thus proving…

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