Jelani Nelson
Jelani Nelson
Verified email at - Homepage
Cited by
Cited by
OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
J Nelson, HL Nguyên
2013 ieee 54th annual symposium on foundations of computer science, 117-126, 2013
An optimal algorithm for the distinct elements problem
DM Kane, J Nelson, DP Woodruff
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on …, 2010
Sparser johnson-lindenstrauss transforms
DM Kane, J Nelson
Journal of the ACM (JACM) 61 (1), 1-23, 2014
Cache-oblivious streaming B-trees
MA Bender, M Farach-Colton, JT Fineman, YR Fogel, BC Kuszmaul, ...
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007
On the exact space complexity of sketching and streaming small norms
DM Kane, J Nelson, DP Woodruff
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
Heavy hitters and the structure of local privacy
M Bun, J Nelson, U Stemmer
ACM Transactions on Algorithms (TALG) 15 (4), 1-40, 2019
Optimality of the Johnson-Lindenstrauss lemma
KG Larsen, J Nelson
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Optimal approximate matrix product in terms of stable rank
MB Cohen, J Nelson, DP Woodruff
arXiv preprint arXiv:1507.02268, 2015
Toward a unified theory of sparse dimensionality reduction in euclidean space
J Bourgain, S Dirksen, J Nelson
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
Sketching and streaming entropy via approximation theory
NJA Harvey, J Nelson, K Onak
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 489-498, 2008
Bounded independence fools degree-2 threshold functions
I Diakonikolas, DM Kane, J Nelson
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 11-20, 2010
Fast moment estimation in data streams in optimal space
DM Kane, J Nelson, E Porat, DP Woodruff
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
Heavy hitters via cluster-preserving clustering
KG Larsen, J Nelson, HL Nguyễn, M Thorup
Communications of the ACM 62 (8), 95-100, 2019
Sorting and selection with imprecise comparisons
M Ajtai, V Feldman, A Hassidim, J Nelson
ACM Transactions on Algorithms (TALG) 12 (2), 1-19, 2015
Almost optimal explicit Johnson-Lindenstrauss families
D Kane, R Meka, J Nelson
International Workshop on Approximation Algorithms for Combinatorial …, 2011
BPTree: An ℓ2 Heavy Hitters Algorithm Using Constant Memory
V Braverman, SR Chestnut, N Ivkin, J Nelson, Z Wang, DP Woodruff
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017
The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
KG Larsen, J Nelson
arXiv preprint arXiv:1411.2404, 2014
A derandomized sparse Johnson-Lindenstrauss transform
DM Kane, J Nelson
arXiv preprint arXiv:1006.3585, 2010
Sparsity lower bounds for dimensionality reducing maps
J Nelson, HL NguyÅn
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
Lower bounds for oblivious subspace embeddings
J Nelson, HL Nguyên
International Colloquium on Automata, Languages, and Programming, 883-894, 2014
The system can't perform the operation now. Try again later.
Articles 1–20