I am a fourth year Ph.D. student in Computer Science at Princeton University. I am very fortunate to have Moses Charikar as my advisor. My main research interests are algorithms for massive data (or in more fashionable language, "big data").
Before coming to Princeton, I studied computer science and math (courses 6 and 18) at MIT.
The best way to reach me is via email at hlnguyen at (university name) dot edu
Copyright warning: the copyright of each paper belongs to the respective publisher. The local copy is only for non-commercial, personal use. Papers published by the ACM can be accessed for free by following links labeled "ACM".
Tight Lower Bound for Linear Sketches of Moments (with Alexandr Andoni, Yury Polyanskiy, and Yihong Wu). In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), 2013. To appear.
Sparsity lower bounds for dimensionality reducing maps (with Jelani Nelson). In Proceedings of the 45th ACM Symposium on Theory of Computing (STOC), 2013. [arXiv]
On the Convergence of the Hegselmann–Krause System (with Arnab Bhattacharyya, Mark Braverman, and Bernard Chazelle). In Proceedings of the 4th Innovations in Theoretical Computer Science (ITCS) conference, 2013. [arXiv]
Eigenvalues of a matrix in the streaming model (with Alexandr Andoni). In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2013.
On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation (with Jelani Nelson and David P. Woodruff). In Proceedings of the 16th International Workshop on Randomization and Computation (RANDOM), 2012. [arXiv]
Improved Range Searching Lower Bounds (with Kasper Green Larsen). In Proceedings of the 28th Annual Symposium on Computational Geometry (SoCG), 2012. [ACM] [pdf]
Width of Points in the Streaming Model (with Alexandr Andoni). Accepted to Transactions on Algorithms special issue of SODA '12. Previously in SODA '12.
Near Linear Lower Bounds for Dimension Reduction in L1 (with Alexandr Andoni, Moses Charikar, and Ofer Neiman). In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2011.
Sublinear Time Algorithms for Earth Mover's Distance (with Khanh Do Ba, Huy N. Nguyen, and Ronitt Rubinfeld). In Theory of Computing Systems. Volume 48, Number 2, 428-442. 2011.
Near-Optimal Sublinear Time Algorithms for Ulam Distance (with Alexandr Andoni). In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010. [pdf] [ps]
Approximate Line Nearest Neighbor in High Dimensions (with Alexandr Andoni, Piotr Indyk, and Robert Krauthgamer). In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2009. [pdf] [ps]
OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings (with Jelani Nelson). 2012. [arXiv]
Antichess: my class project (with Risa Kawai and Elizabeth Murnane) for 6.170 at MIT. We won the class tournament!
The proper spelling of my name in Vietnamese order is Nguyễn Lê Huy.
