Daniel Dadush
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Makrand Sinhaonce
- Neil Olveronce
- Sander Borstonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Majorizing Measures for the Optimizer | ITCS 2021 | 2021-01-06 |
Proves a constructive version of the majorizing measures duality: a convex program for the Gaussian chaining functional and a simplified dual are within a… | ||
| On Approximating the Covering Radius and Finding Dense Lattice Subspaces | Lattices: Geometry, Algorithms and Hardness 2020 | 2020-02-18 |
Links covering-radius approximation to integer programming by reducing to lattice enumeration using M-ellipsoids and Voronoi connectivity, gives… | ||
| On Approximating the Covering Radius and Finding Dense Lattice Subspaces | Discrete Optimization via Continuous Relaxation | 2017-09-11 |
Gives concrete claims: computes a near-optimal dense lattice subspace in single-exponential time (2^{O(n)}) and finds projection certificates that upper- and… | ||
| Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling – Daniel Dadush | The Mathematics of Modern Cryptography | 2015-07-06 |
Claims an exact CVP algorithm running in 2^n time by sampling from a shifted discrete Gaussian and combining collisions; samples require parameters bounded by… | ||
| nothing matches | ||