| 2026 | SODA | One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches. | Edith Cohen, Jelani Nelson, Tams Sarls, Mihir Singhal, Uri Stemmer |
| 2024 | COLT | Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries. | Edith Cohen, Xin Lyu, Jelani Nelson, Tams Sarls, Uri Stemmer |
| 2024 | ICML | Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages. | Hilal Asi, Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar, Samson Zhou |
| 2024 | ICML | Sparse Dimensionality Reduction Revisited. | Mikael Mller Hgsgaard, Lior Kamma, Kasper Green Larsen, Jelani Nelson, Chris Schwiegelshohn |
| 2023 | AAAI | Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs. | Edith Cohen, Jelani Nelson, Tams Sarls, Uri Stemmer |
| 2023 | SODA | Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds. | Justin Y. Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Shyam Narayanan, Jelani Nelson, Yinzhan Xu |
| 2023 | STOC | Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. | Edith Cohen, Xin Lyu, Jelani Nelson, Tams Sarls, Uri Stemmer |
| 2022 | ICML | On the Robustness of CountSketch to Adaptive Inputs. | Edith Cohen, Xin Lyu, Jelani Nelson, Tams Sarls, Moshe Shechner, Uri Stemmer |
| 2022 | ICML | Private frequency estimation via projective geometry. | Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar |
| 2022 | PODS | Optimal Bounds for Approximate Counting. | Jelani Nelson, Huacheng Yu |
| 2022 | STOC | Uniform approximations for Randomized Hadamard Transforms with applications. | Yeshwanth Cherapanamjeri, Jelani Nelson |
| 2021 | FOCS | Terminal Embeddings in Sublinear Time. | Yeshwanth Cherapanamjeri, Jelani Nelson |
| 2021 | STACS | An Improved Sketching Algorithm for Edit Distance. | Ce Jin, Jelani Nelson, Kewen Wu |
| 2019 | SODA | Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. | Jelani Nelson, Huacheng Yu |
| 2019 | STOC | Optimal terminal dimensionality reduction in Euclidean space. | Shyam Narayanan, Jelani Nelson |
| 2018 | ISIT | A Note on Reductions Between Compressed Sensing Guarantees. | Tom Morgan, Jelani Nelson |
| 2018 | PODS | Heavy Hitters and the Structure of Local Privacy. | Mark Bun, Jelani Nelson, Uri Stemmer |
| 2018 | SODA | Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. | Michael B. Cohen, T. S. Jayram, Jelani Nelson |
| 2017 | FOCS | Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams. | Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh |
| 2017 | FOCS | Optimality of the Johnson-Lindenstrauss Lemma. | Kasper Green Larsen, Jelani Nelson |
| 2017 | PODS | BPTree: An ℓ | Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, David P. Woodruff |
| 2016 | FOCS | Heavy Hitters via Cluster-Preserving Clustering. | Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup |
| 2016 | ICALP | An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm. | Jaroslaw Blasiok, Jelani Nelson |
| 2016 | ICALP | Optimal Approximate Matrix Product in Terms of Stable Rank. | Michael B. Cohen, Jelani Nelson, David P. Woodruff |
| 2016 | ICALP | The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction. | Kasper Green Larsen, Jelani Nelson |
| 2015 | STOC | Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space. | Jean Bourgain, Sjoerd Dirksen, Jelani Nelson |
| 2015 | STOC | Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. | Kasper Green Larsen, Jelani Nelson, Huy L. Nguyn |
| 2014 | ICALP | Lower Bounds for Oblivious Subspace Embeddings. | Jelani Nelson, Huy L. Nguyn |
| 2014 | SODA | New constructions of RIP matrices with fast multiplication and fewer rows. | Jelani Nelson, Eric Price, Mary Wootters |
| 2013 | FOCS | OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings. | Jelani Nelson, Huy L. Nguyen |
| 2013 | STOC | Sparsity lower bounds for dimensionality reducing maps. | Jelani Nelson, Huy L. Nguyen |
| 2012 | SODA | Sparser Johnson-Lindenstrauss transforms. | Daniel M. Kane, Jelani Nelson |
| 2011 | STOC | Fast moment estimation in data streams in optimal space. | Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff |
| 2010 | FOCS | Bounded Independence Fools Degree-2 Threshold Functions. | Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson |
| 2010 | PODS | An optimal algorithm for the distinct elements problem. | Daniel M. Kane, Jelani Nelson, David P. Woodruff |
| 2010 | PODS | Fast Manhattan sketches in data streams. | Jelani Nelson, David P. Woodruff |
| 2010 | SODA | On the Exact Space Complexity of Sketching and Streaming Small Norms. | Daniel M. Kane, Jelani Nelson, David P. Woodruff |
| 2009 | ICALP | Sorting and Selection with Imprecise Comparisons. | Mikls Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson |
| 2008 | FOCS | Sketching and Streaming Entropy via Approximation Theory. | Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak |
| 2008 | ITW | Streaming algorithms for estimating entropy. | Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak |
| 2007 | SPAA | Cache-oblivious streaming B-trees. | Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson |