Noah Stephens-Davidowitz

892 total citations
15 papers, 128 citations indexed

About

Noah Stephens-Davidowitz is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Noah Stephens-Davidowitz has authored 15 papers receiving a total of 128 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 9 papers in Computational Theory and Mathematics and 3 papers in Computer Networks and Communications. Recurrent topics in Noah Stephens-Davidowitz's work include Cryptography and Data Security (8 papers), Complexity and Algorithms in Graphs (7 papers) and Coding theory and cryptography (4 papers). Noah Stephens-Davidowitz is often cited by papers focused on Cryptography and Data Security (8 papers), Complexity and Algorithms in Graphs (7 papers) and Coding theory and cryptography (4 papers). Noah Stephens-Davidowitz collaborates with scholars based in United States, Singapore and Switzerland. Noah Stephens-Davidowitz's co-authors include Oded Regev, Daniel Dadush, Divesh Aggarwal, Chris Peikert, Victor Shoup, Tzipora Halevi, Shai Halevi, Daniel Wichs, Adi Shamir and Vinod Vaikuntanathan and has published in prestigious journals such as Annals of Mathematics, Algorithmica and Journal of Number Theory.

In The Last Decade

Noah Stephens-Davidowitz

12 papers receiving 123 citations

Peers

Noah Stephens-Davidowitz

CTM

CVPR

EEE

Ilan Komargodski Israel

John Abbott Italy

Ishay Haviv Israel

Iftach Haitner Israel

Jan van den Brand United States

Clément Pernet France

Pritish Kamath United States

Stanislav Bulygin Germany

Maximilian Probst Gutenberg Switzerland

M.J. Coster Netherlands

Ilan Komargodski Israel

Noah Stephens-Davidowitz

124 ×1.2

83 ×1.3

CTM

30 ×1.7

CVPR

21 ×1.4

11 ×0.7

EEE

Citations per year, relative to Noah Stephens-Davidowitz Noah Stephens-Davidowitz (= 1×) peers Ilan Komargodski

Countries citing papers authored by Noah Stephens-Davidowitz

Since Specialization

Citations

This map shows the geographic impact of Noah Stephens-Davidowitz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Noah Stephens-Davidowitz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Noah Stephens-Davidowitz more than expected).

Fields of papers citing papers by Noah Stephens-Davidowitz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Noah Stephens-Davidowitz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Noah Stephens-Davidowitz. The network helps show where Noah Stephens-Davidowitz may publish in the future.

Co-authorship network of co-authors of Noah Stephens-Davidowitz

This figure shows the co-authorship network connecting the top 25 collaborators of Noah Stephens-Davidowitz. A scholar is included among the top collaborators of Noah Stephens-Davidowitz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Noah Stephens-Davidowitz. Noah Stephens-Davidowitz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

15 of 15 papers shown

Regev, Oded & Noah Stephens-Davidowitz. (2025). A simple proof of a reverse Minkowski theorem for integral lattices. Journal of Number Theory. 279. 256–266.

Regev, Oded & Noah Stephens-Davidowitz. (2023). A reverse Minkowski theorem. Annals of Mathematics. 199(1).

Aggarwal, Divesh, Zvika Brakerski, Alexander Golovnev, et al.. (2023). Lattice Problems beyond Polynomial Time. 1516–1526. 3 indexed citations

Aggarwal, Divesh, et al.. (2020). Extractor Lower Bounds, Revisited. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 26. 173. 1 indexed citations

Stephens-Davidowitz, Noah. (2019). A time-distance trade-off for GDD with preprocessing---Instantiating the\n DLW heuristic. arXiv (Cornell University). 1 indexed citations

Stephens-Davidowitz, Noah & Vinod Vaikuntanathan. (2019). SETH-Hardness of Coding Problems. 18. 287–301. 1 indexed citations

Aggarwal, Divesh & Noah Stephens-Davidowitz. (2018). Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 19. 4 indexed citations

Peikert, Chris, Oded Regev, & Noah Stephens-Davidowitz. (2017). Pseudorandomness of ring-LWE for any ring and modulus. 461–473. 41 indexed citations

Regev, Oded & Noah Stephens-Davidowitz. (2017). A reverse Minkowski theorem. 941–953. 7 indexed citations

10.

Halevi, Shai, Tzipora Halevi, Victor Shoup, & Noah Stephens-Davidowitz. (2017). Implementing BP-Obfuscation Using Graph-Induced Encoding. 783–798. 7 indexed citations

11.

Dodis, Yevgeniy, Adi Shamir, Noah Stephens-Davidowitz, & Daniel Wichs. (2016). How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs. Algorithmica. 79(4). 1196–1232. 4 indexed citations

12.

Stephens-Davidowitz, Noah. (2016). Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 60. 18.

13.

Aggarwal, Divesh, Daniel Dadush, Oded Regev, & Noah Stephens-Davidowitz. (2015). Solving the Shortest Vector Problem in 2 ⁿ Time Using Discrete Gaussian Sampling. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 733–742. 27 indexed citations

14.

Aggarwal, Divesh, Daniel Dadush, & Noah Stephens-Davidowitz. (2015). Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!. Data Archiving and Networked Services (DANS). 563–582. 22 indexed citations

15.

Dadush, Daniel, Oded Regev, & Noah Stephens-Davidowitz. (2014). On the Closest Vector Problem with a Distance Guarantee. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 98–109. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact