default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuy L. Nguyen
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Huy L. Nguyen 0001
![[0000-0002-6112-3763]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-6112-3763")
(aka: Huy L. Nguyên 0001, Huy Le Nguyen 0001) — Northeastern University, College of Computer and Information Science, Boston, MA, USA (and 3 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j7]Lijie Chen, Alexander Golovnev, Huy Le Nguyen:
Special Section on The Sixty-Third Annual IEEE Symposium on Foundations of Computer Science (2022). SIAM J. Comput. 54(5): S22- (2025)- 2024
- [i18]Thien Hang Nguyen, Huy Le Nguyen:
Efficient Adaptive Optimization via Subset-Norm and Subspace-Momentum: Fast, Memory-Reduced Training with Convergence Guarantees. CoRR abs/2411.07120 (2024) - 2022
- [j6]Tharani Thathsara Rajapaksha, Amila Alexander, Leshan Fernando, Anh Than, Huy Le Nguyen:
Real-Time Weather Monitoring and IoT-Based Palmtop Device for Smart Agriculture. SN Comput. Sci. 3(1): 91 (2022) - [c16]Anamay Chaturvedi, Matthew Jones, Huy Le Nguyen:
Locally Private k-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error. AAAI 2022: 6167-6174 - [c15]Huy Le Nguyen, Dominique F. Chu:
Incremental Neural Synthesis for Spiking Neural Networks. SSCI 2022: 649-656 - [i17]Thien Hang Nguyen, Hongyang R. Zhang, Huy Le Nguyen:
Improved Worst-Group Robustness via Classifier Retraining on Independent Splits. CoRR abs/2204.09583 (2022) - [i16]Huy Le Nguyen, Thy Dinh Nguyen, Matthew Jones:
Fair Range k-center. CoRR abs/2207.11337 (2022) - [i15]Matthew Jones, Huy Le Nguyen, Thy Dinh Nguyen:
An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret. CoRR abs/2209.11817 (2022) - [i14]Anamay Chaturvedi, Huy Le Nguyen, Thy Dinh Nguyen:
Streaming Submodular Maximization with Differential Privacy. CoRR abs/2210.14315 (2022) - [i13]Thy Dinh Nguyen, Anamay Chaturvedi, Huy Le Nguyen:
Improved Learning-augmented Algorithms for k-means and k-medians Clustering. CoRR abs/2210.17028 (2022) - 2021
- [j5]Dominique F. Chu, Huy Le Nguyen:
Constraints on Hebbian and STDP learned weights of a spiking neuron. Neural Networks 135: 192-200 (2021) - [c14]Anamay Chaturvedi, Huy Le Nguyen, Lydia Zakynthinou:
Differentially Private Decomposable Submodular Maximization. AAAI 2021: 6984-6992 - [c13]Huy Phan, Huy Le Nguyen, Oliver Y. Chén, Lam Dang Pham, Philipp Koch, Ian McLoughlin, Alfred Mertins:
Multi-View Audio And Music Classification. ICASSP 2021: 611-615 - [c12]Huy Phan, Huy Le Nguyen, Oliver Y. Chén, Philipp Koch, Ngoc Q. K. Duong, Ian McLoughlin, Alfred Mertins:
Self-Attention Generative Adversarial Network for Speech Enhancement. ICASSP 2021: 7103-7107 - [i12]Huy Phan, Huy Le Nguyen, Oliver Y. Chén, Lam Dang Pham, Philipp Koch, Ian McLoughlin, Alfred Mertins:
Multi-view Audio and Music Classification. CoRR abs/2103.02420 (2021) - [i11]Huy Le Nguyen, Dominique F. Chu:
Linear Constraints Learning for Spiking Neurons. CoRR abs/2103.12564 (2021) - 2020
- [c11]Huy Le Nguyen, Jonathan R. Ullman, Lydia Zakynthinou:
Efficient Private Algorithms for Learning Large-Margin Halfspaces. ALT 2020: 704-724 - [i10]Matthew Jones, Huy Le Nguyen, Thy Dinh Nguyen:
Differentially Private Clustering via Maximum Coverage. CoRR abs/2008.12388 (2020) - [i9]Huy Phan, Huy Le Nguyen, Oliver Y. Chén, Philipp Koch, Ngoc Q. K. Duong, Ian McLoughlin, Alfred Mertins:
Self-Attention Generative Adversarial Network for Speech Enhancement. CoRR abs/2010.09132 (2020) - [i8]Dominique F. Chu, Huy Le Nguyen:
Constraints on Hebbian and STDP learned weights of a spiking neuron. CoRR abs/2012.07664 (2020)
2010 – 2019
- 2016
- [c10]Alexander L. Kazakov, Anna A. Lempert, Huy L. Nguyen:
The Problem of the Optimal Packing of the Equal Circles for Special Non-Euclidean Metric. AIST 2016: 58-68 - [i7]Jiecao Chen, Huy L. Nguyen, Qin Zhang:
Submodular Maximization over Sliding Windows. CoRR abs/1611.00129 (2016) - 2015
- [j4]Lior Kamma, Robert Krauthgamer, Huy L. Nguyen:
Cutting Corners Cheaply, or How to Remove Steiner Points. SIAM J. Comput. 44(4): 975-995 (2015) - [c9]Wolfgang Mulzer, Huy L. Nguyên, Paul Seiferth, Yannik Stein:
Approximate k-flat Nearest Neighbor Search. STOC 2015: 783-792 - 2014
- [j3]Robert Krauthgamer, Huy L. Nguyen, Tamar Zondiner:
Preserving Terminal Distances Using Minors. SIAM J. Discret. Math. 28(1): 127-141 (2014) - [c8]Ankit Garg, Tengyu Ma, Huy L. Nguyen:
On Communication Cost of Distributed Statistical Estimation and Dimensionality. NIPS 2014: 2726-2734 - [c7]Lior Kamma, Robert Krauthgamer, Huy L. Nguyen:
Cutting corners cheaply, or how to remove Steiner points. SODA 2014: 1029-1040 - [i6]Ankit Garg, Tengyu Ma, Huy L. Nguyen:
Lower Bound for High-Dimensional Statistical Learning Problem via Direct-Sum Theorem. CoRR abs/1405.1665 (2014) - [i5]Wolfgang Mulzer, Huy L. Nguyen, Paul Seiferth, Yannik Stein:
Approximate k-flat Nearest Neighbor Search. CoRR abs/1411.1519 (2014) - 2013
- [c6]Alexandr Andoni, Huy L. Nguyên, Yury Polyanskiy, Yihong Wu:
Tight Lower Bound for Linear Sketches of Moments. ICALP (1) 2013: 25-32 - [c5]Alexandr Andoni, Huy L. Nguyen:
Eigenvalues of a matrix in the streaming model. SODA 2013: 1729-1737 - [i4]Lior Kamma, Robert Krauthgamer, Huy L. Nguyen:
Cutting corners cheaply, or how to remove Steiner points. CoRR abs/1304.1449 (2013) - [i3]Huy L. Nguyen:
Approximate Nearest Neighbor Search in ℓp. CoRR abs/1306.3601 (2013) - [i2]Alexandr Andoni, Huy L. Nguyen, Yury Polyanskiy, Yihong Wu:
Tight Lower Bound for Linear Sketches of Moments. CoRR abs/1306.6295 (2013) - 2012
- [j2]Andrew Cron, Huy L. Nguyen, Aditya G. Parameswaran:
Big data. XRDS 19(1): 7-8 (2012) - [c4]Alexandr Andoni, Huy L. Nguyen:
Width of points in the streaming model. SODA 2012: 447-452 - 2011
- [j1]Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt Rubinfeld:
Sublinear Time Algorithms for Earth Mover's Distance. Theory Comput. Syst. 48(2): 428-442 (2011) - [c3]Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen:
Near Linear Lower Bound for Dimension Reduction in L1. FOCS 2011: 315-323 - 2010
- [c2]Alexandr Andoni, Huy L. Nguyen:
Near-Optimal Sublinear Time Algorithms for Ulam Distance. SODA 2010: 76-86
2000 – 2009
- 2009
- [c1]Alexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen:
Approximate line nearest neighbor in high dimensions. SODA 2009: 293-301 - [i1]Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt Rubinfeld:
Sublinear Time Algorithms for Earth Mover's Distance. CoRR abs/0904.0292 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-06 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
