pith. sign in

Daniel Dadush

Identifiers

  • name variant Daniel Dadush 0.60 · backfill

Papers (27)

  1. Dynamic Detours cs.DS · 2026 · author #1
  2. Greedy Algorithms for Shortcut Sets and Hopsets cs.DS · 2025 · author #4
  3. Lower bounds for cube-ideal set-systems math.CO · 2025 · author #3
  4. Lattice-based Locality Sensitive Hashing is Optimal cs.DS · 2017 · author #2
  5. A Friendly Smoothed Analysis of the Simplex Method cs.DS · 2017 · author #1
  6. The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues cs.DS · 2017 · author #2
  7. AWGN-Goodness is Enough: Capacity-Achieving Lattice Codes based on Dithered Probabilistic Shaping cs.IT · 2017 · author #2
  8. Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem cs.DS · 2016 · author #1
  9. Rescaling Algorithms for Linear Conic Feasibility math.OC · 2016 · author #1
  10. Towards Strong Reverse Minkowski-type Inequalities for Lattices math.MG · 2016 · author #1
  11. On the Lattice Distortion Problem cs.DS · 2016 · author #2
  12. An Algorithm for Koml\'os Conjecture Matching Banaszczyk's bound cs.DS · 2016 · author #2
  13. Solving the Closest Vector Problem in $2^n$ Time--- The Discrete Gaussian Strikes Again! cs.DS · 2015 · author #2
  14. Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling cs.DS · 2014 · author #2
  15. On the Lattice Smoothing Parameter Problem cs.CC · 2014 · author #2
  16. On the Shadow Simplex Method for Curved Polyhedra cs.DS · 2014 · author #1
  17. Short Paths on the Voronoi Graph and the Closest Vector Problem with Preprocessing cs.DS · 2014 · author #2
  18. On the Closest Vector Problem with a Distance Guarantee cs.DS · 2014 · author #1
  19. A Deterministic Polynomial Space Construction for eps-nets under any Norm cs.CC · 2013 · author #1
  20. On the existence of 0/1 polytopes with high semidefinite extension complexity cs.CC · 2013 · author #2
  21. Lattice Sparsification and the Approximate Closest Vector Problem cs.DS · 2012 · author #1
  22. Near-Optimal Deterministic Algorithms for Volume Computation and Lattice Problems via M-Ellipsoids cs.CC · 2012 · author #1
  23. A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming cs.DS · 2011 · author #1
  24. Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms cs.CC · 2011 · author #1
  25. Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid Coverings cs.DS · 2010 · author #1
  26. On the Chvatal-Gomory Closure of a Compact Convex Set math.OC · 2010 · author #1
  27. Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families cs.DS · 2009 · author #2

Mentions

  • 1212.6781 #1 · backfill · confidence 0.70 Daniel Dadush
  • 1201.5972 #1 · backfill · confidence 0.70 Daniel Dadush
  • 1109.2477 #1 · backfill · confidence 0.70 Daniel Dadush
  • 1107.5478 #1 · backfill · confidence 0.70 Daniel Dadush
  • 1011.5666 #1 · backfill · confidence 0.70 Daniel Dadush
  • 1011.1710 #1 · backfill · confidence 0.70 Daniel Dadush
  • 0904.0583 #2 · backfill · confidence 0.70 Daniel Dadush

Frequent Coauthors