Jelani Nelson Ph.D. student in the CSAIL Theory of Computation group working with Prof. Erik Demaine. 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

• 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]


• 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]


• Timothy Abbott, Erik D. Demaine, Martin L. Demaine, Daniel Kane, Stefan Langerman, Jelani Nelson, and Vincent Yeung. Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane. Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005), Windsor, Ontario, Canada, August 10-12, 2005. [ps][pdf]