Jelani Nelson
Artificial Intelligence · 2010–2017
A researcher in the Science corpus: 4 papers; trusts 40 researchers and is trusted by 61 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 40 citations into it; #5,064 of 35,345 by trust here, #10,065 by citations
- Computational Mechanics — 18 citations into it; #881 of 10,001 by trust here, #2,715 by citations
- Computational Theory and Mathematics — 15 citations into it; #1,521 of 12,182 by trust here, #4,696 by citations
- Privacy & Security — 14 citations into it; #205 of 709 by trust here, #404 by citations
- Statistics and Probability — 12 citations into it
- Algorithms & Complexity — 9 citations into it; #205 of 516 by trust here, #207 by citations
- Computer Graphics and Computer-Aided Design — 7 citations into it
- Applied Mathematics — 6 citations into it
Whom Jelani Nelson trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Kenneth L. Clarkson
- Tamás Sarlós
- Terence Tao
- David P. Woodruff
- Cynthia Dwork
- William B. Johnson
- Z. Bai
- Nir Ailon
- Daniel M. Kane
- Uri Stemmer
Who trusts Jelani Nelson overall
- David P. Woodruff
- Mert Pilanci
- Zhao Song
- Yin Tat Lee
- Kenneth L. Clarkson
- Michael B. Cohen
- Martin J. Wainwright
- Ilya P. Razenshteyn
- Aaron Sidford
- Jayadev Acharya
Papers from Jelani Nelson's perspective
Ordered by how strongly the researchers Jelani Nelson trusts endorse each paper. Same corpus, a different order for every researcher.
- Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
- ImageNet classification with deep convolutional neural networks
- Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Gradient-based learning applied to document recognition
- The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors
- Learning Multiple Layers of Features from Tiny Images
- Numerical linear algebra in the streaming model (Symposium on the Theory of Computing)
- Boosting and Differential Privacy
- On variants of the Johnson–Lindenstrauss lemma (Random Struct. Algorithms)
Their papers
- Heavy Hitters and the Structure of Local Privacy (2017) — 166 citations
- OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings (2012) — 417 citations
- An optimal algorithm for the distinct elements problem (2010) — 376 citations
- Sparser Johnson-Lindenstrauss Transforms (2010) — 397 citations