Zengfeng Huang

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Optimal framework for clustering with noisy queries	2026-01-28	Paper
\(\mathrm{Contra}^2\): A one-step active learning method for imbalanced graphs Artificial Intelligence	2025-12-12	Paper
Space complexity of Euclidean clustering	2025-11-24	Paper
The communication complexity of distributed -approximations	2025-08-05	Paper
Implicit vs unfolded graph neural networks Journal of Machine Learning Research (JMLR)	2025-08-05	Paper
Space complexity of Euclidean clustering IEEE Transactions on Information Theory	2025-07-14	Paper
The communication complexity of distributed maximization	2025-06-17	Paper
Lipschitz bandits with batched feedback IEEE Transactions on Information Theory	2024-07-22	Paper
Communication-efficient distributed covariance sketch, with application to distributed PCA	2021-07-09	Paper
Communication complexity of approximate maximum matching in the message-passing model Distributed Computing	2021-01-22	Paper
Randomized algorithms for tracking distributed count, frequencies, and ranks Algorithmica	2019-05-17	Paper
Dynamic graph stream algorithms in \(o(n)\) space Algorithmica	2019-05-07	Paper
scientific article; zbMATH DE number 7049775 (Why is no real title available?)	2019-05-02	Paper
Dynamic graph stream algorithms in \(o(n)\) space (available as arXiv preprint)	2017-12-19	Paper
The Communication Complexity of Distributed epsilon-Approximations SIAM Journal on Computing	2017-08-18	Paper
Communication complexity of approximate matching in distributed graphs	2017-01-24	Paper
Clairvoyant mechanisms for online auctions Lecture Notes in Computer Science	2016-09-02	Paper
Mergeable summaries ACM Transactions on Database Systems	2015-09-03	Paper

Research outcomes over time

This page was built for person: Zengfeng Huang