◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Dadush

5 papers hereh-index 211.4k citations74 works total

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

author position
  • first author4
  • middle author1

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

fields
  • cs.DS3
  • cs.CC1
  • math.OC1

identity via Semantic Scholar / OpenAlex

activity
20092012
most citedDeterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms

3 citations · 4 across the 5 of their papers we have counts for

collaborators
Showing 2012 · cs.DSShow all

1 paper · 2 filters

cs.DS2012

Lattice Sparsification and the Approximate Closest Vector Problem

Daniel Dadush, Gabor Kun

We give a deterministic algorithm for solving the (1+eps)-approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2^{O(n)}(1+1/eps)^n time and 2^n pol…

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