According to Wikipedia, Jelani Osei Nelson is an Ethiopian-American Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He won the 2014 Presidential Early Career Award for Scientists and Engineers. Nelson is the creator of AddisCoder, a computer science summer program for Ethiopian high school students in Addis Ababa.
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
External-Memory Search Trees with Fast Insertions by Jelani Nelson (2006) (0)
Lecture 27 — December 2nd, 2014 (2014) (0)
We start a new topic, amortized analysis. In this lecture, we will explain what amortization is and apply it to the analysis of two data structures: Binomial Heaps and Fibonacci Heaps. (2014) (0)
Sparsity lower bounds for dimensionality reducing maps how this access benefits you. Your story matters (2012) (0)
Sketching Algorithms for Big Data Fall 2017 Lecture 2 — September 5 (2017) (0)
Sketching based Representations for Robust Image Classification with Provable Guarantees (2022) (0)
Cs 229r: Algorithms for Big Data 2 Dimensionality Reduction 2.2 Limitations of Dimensionality Reduction (2013) (0)
Cs 229r: Algorithms for Big Data 2 Sparse Jl from Last Time (2015) (0)
An Improved Sketching Bound for Edit Distance (2020) (0)
Sketching Algorithms for Big Data Fall 2017 Lecture 6 — September 19 , 2017 (2017) (0)
In the last lecture we covered nearest neighbor search with guest lecturer Piotr Indyk. In this lecture we cover solving linear programs using the simplex algorithm. (2014) (0)
18.409: Topics in TCS: Embeddings of Finite Metric Spaces (2006) (0)
In the last lecture we proved Lipschitz-concentration and the Decoupling lemma, and discussed Alon's lower bound for dimensionality reduction with small distortion (m & 1 (2013) (0)
2 The Distinct Elements Problem (2013) (0)
Dynamic ham-sandwich cuts in the plane Citation (2009) (0)
Cs 229r: Algorithms for Big Data Lecture 03, September 11th 2 Main Section 2.1 Space Lower Bounds for Streaming Algorithms (2015) (0)
Sparser Johnson-Lindenstrauss Transforms this article openly available. Please share how this access benefits you. Your story matters (2014) (0)
Cs 229r: Algorithms for Big Data Lecture October 13th 3 Main Section 3.1 Lower Bounds on Dimensionality Reduction 3.1.1 Lower Bounds on Distributional Johnson Lindenstrauss Lemma (2015) (0)
In the last lecture we discussed how distributional JL implies Gordon's theorem, and began our discussion of sparse JL. We wrotek xk 2 = T A TAx and bounded the expression using Hanson- Wright in terms of the Frobenius norm. (2015) (0)
In the last lecture we proved several space lower bounds for streaming algorithms using the com- munication complexity model, and some ideas from information theory. (2013) (0)
allow for faster multiplication. Last lecture, we presented a construction that performed faster when the vectors to be transformed are sparse. This lecture, we will present a JL matrix that performs faster multiplication with dense vectors. (2013) (0)
Almost Optimal Explicit Johnson-Lindenstrauss Families this benefits you. Your matters (2011) (0)
2 Näıve Decoding of Concatenated Codes (2008) (0)
Lecture 4 — September 16, 2014 (2014) (0)
Topics in TCS : Embeddings of Finite Metric Spaces November 29 , 2006 Punyashloka Biswal and Jelani Nelson Embedding series-parallel graphs into ` 1 1 Introduction (0)
This paper list is powered by the following services:
