( en | de | ru )

 

Disambiguation of "Stephens-Davidowitz, Noah"

Author of the publication

copydeleteadd this publication to your clipboard
On the Lattice Distortion Problem.

, , and . ESA, volume 57 of LIPIcs, page 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hans Noah

Owen Stephens

Elizabeth Stephens

Frauke Christine Noah

Ernst Magnus Noah

 

Other publications of authors with the same name

(Gap/S)ETH Hardness of SVP., and . CoRR, (2017)On the Hardness of Average-case k-SUM., , and . CoRR, (2020)The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices., , and . Electron. Colloquium Comput. Complex., (2024)On the Lattice Distortion Problem., , and . ESA, volume 57 of LIPIcs, page 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Gaussian Measure Over Lattices.. New York University, USA, (2017)Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)., , , and . SODA, page 1816-1835. SIAM, (2021)Extractor Lower Bounds, Revisited., , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A 2n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP., , and . CoRR, (2020)Slide Reduction, Revisited - Filling the Gaps in SVP Approximation., , , and . CRYPTO (2), volume 12171 of Lecture Notes in Computer Science, page 274-295. Springer, (2020)On the (im)possibility of branch-and-bound search-to-decision reductions for approximate optimization., , , and . Electron. Colloquium Comput. Complex., (2021)