Nelson was born to an Ethiopian mother and an African-American father in Los Angeles, then grew up in St. Thomas, U.S. Virgin Islands.[1][2] He studied mathematics and computer science at the Massachusetts Institute of Technology and remained there to complete his doctoral studies in computer science.[3] His Master's dissertation, External-Memory Search Trees with Fast Insertions, was supervised by Bradley C. Kuszmaul and Charles E. Leiserson.[4] He was a member of the theory of computation group, working on efficient algorithms for massive datasets. His doctoral dissertation, Sketching and Streaming High-Dimensional Vectors (2011[5]), was supervised by Erik Demaine and Piotr Indyk.[6]
Nelson is interested in big data and the development of efficient algorithms.[8] He joined the computer science faculty at Harvard University in 2013 and remained there until 2019 before joining UC Berkeley.[9] He is known for his contributions to streaming algorithms and dimensionality reduction, including proving that the Johnson–Lindenstrauss lemma is optimal (with Kasper Green Larsen),[10] developing the Sparse Johnson-Lindenstrauss Transform (with Daniel Kane),[11] and an asymptotically optimal algorithm for the count-distinct problem (with Daniel Kane and David P. Woodruff).[12] He holds two patents related to applications of streaming algorithms to network traffic monitoring applications.[13][14]
Nelson was the recipient of an Office of Naval Research Young Investigator Award in 2015 and a Director of Research Early Career Award in 2016.[15] He was awarded an Alfred P. Sloan Foundation Fellowship in 2017.[16]
Advocacy for rigorous math education
Nelson opposes the proposed California Mathematics Framework, expressing concern that the modified curriculum will harm vulnerable students by denying them rigorous mathematical instruction. In an interview with The New Yorker, he stated: “I’m extremely worried that the C.M.F. is implicitly advocating for certain groups of people to be pushed away from rigorous math courses into essentially a lower track, setting back progress in improving diversity in STEM.”[17] Nelson was involved in an online conflict with Stanford University professor Jo Boaler over efforts to revise California's framework for math instruction in April 2022.[18][19][20]
AddisCoder and JamCoders
Nelson founded AddisCoder, a summer program teaching computer science and algorithms to high schoolers in Ethiopia, in 2011 while finishing his PhD at Massachusetts Institute of Technology,.[21] The program has trained over 500 alumni, some of whom have gone on to study at Harvard, MIT, Columbia, Stanford, Cornell, Princeton, KAIST, and Seoul National University, and to pursue PhDs in science and mathematics.[21] Starting in 2022, Nelson also co-organized JamCoders, a summer algorithms and coding camp in Jamaica modeled on AddisCoder.[22]
David Harold Blackwell Summer Research Institute
Nelson co-founded the David Harold Blackwell Summer Research Institute, which aims to increase the number of African-American students receiving PhDs in mathematics.[17]
^External-memory search trees with fast insertions (Thesis). Charles E. Leiserson and Bradley C. Kuszmaul., Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science., Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. 2006. hdl:1721.1/37084. Archived from the original on 2015-09-21. Retrieved 2018-10-27.{{cite thesis}}: CS1 maint: others (link)
^Nelson, Jelani. "Curriculum Vitae"(PDF). Jelani Nelson. Retrieved 4 December 2022.
^Sketching and streaming high-dimensional vectors (Thesis). Erik D. Demaine and Piotr Indyk., Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science., Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. 2011. hdl:1721.1/66314. Archived from the original on 2015-09-19. Retrieved 2018-10-27.{{cite thesis}}: CS1 maint: others (link)
^
Kasper Green Larsen; Jelani Nelson (2017). Optimality of the Johnson-Lindenstrauss Lemma. Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS). pp. 633–638. arXiv:1609.02094. doi:10.1109/FOCS.2017.64.
^Daniel M. Kane; Jelani Nelson; David P. Woodruff (2010). "An Optimal Algorithm for the Distinct Elements Problem". Proceedings of the 29th Annual ACM Symposium on Principles of Database Systems (PODS).
