Jelani Nelson MIT CSAIL 32 Vassar St., Room 32-G630 Cambridge, MA 02139 minilek@mit.edu Ph.D. student in the CSAIL Theory of Computation group working with Prof. Erik Demaine and Prof. Piotr Indyk. Before that I was an MEng. student in the SuperTech group under the direction of Dr. Bradley Kuszmaul and Prof. Charles Leiserson. As an undergraduate here I lived in Bexley Hall and studied Computer Science and Mathematics. Before that I was at All Saints Cathedral School from 1st to 12th grade.

Papers

• Ilias Diakonikolas, Daniel M. Kane, Jelani Nelson. Bounded Independence Fools Degree-2 Threshold Functions. Manuscript. [ps][pdf][arXiv][ECCC]


• Daniel M. Kane, Jelani Nelson, David P. Woodruff. On the Exact Space Complexity of Sketching and Streaming Small Norms. Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, TX, January 17-19, 2010. [ps][pdf]


• Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson. Sorting and Selection with Imprecise Comparisons. Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Rhodes, Greece, July 5-12, 2009. [ps][pdf][full version]


• Jelani Nelson, David P. Woodruff. A Near-Optimal Algorithm for L1-Difference. Manuscript. [ps][pdf][arXiv]


• Timothy G. Abbott, Michael A. Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel M. Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung. Dynamic Ham-Sandwich Cuts in the Plane. Computational Geometry: Theory And Applications (CGTA), 42(5): 419-428, 2009. [ps][pdf]
  Preliminary version in Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005). [ps][pdf]


• Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak. Sketching and Streaming Entropy via Approximation Theory. Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), Philadelphia, PA, October 26-28, 2008. [ps][pdf][arXiv]


• Jelani Nelson. A Note on Set Cover Inapproximability Independent of Universe Size. Electronic Colloquium on Computational Complexity (ECCC), TR07-105, 2007. [ps][pdf]


• Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan Fogel, Bradley C. Kuszmaul, Jelani Nelson. Cache-Oblivious Streaming B-trees. Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), San Diego, CA, June 9-11, 2007. [ps][pdf]


• Jelani Nelson. External-Memory Search Trees with Fast Insertions. M.Eng. Thesis. 2006. [ps][pdf]