Research output per year
Research output per year
Fingerprint
Dive into the research topics where Huacheng Yu is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Network
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
NEARLY OPTIMAL STATIC LAS VEGAS SUCCINCT DICTIONARY
Huacheng, Y. U., 2022, In: SIAM Journal on Computing. 51, 3, p. 174-249 76 p.Research output: Contribution to journal › Article › peer-review
-
Optimal Bounds for Approximate Counting
Nelson, J. & Yu, H., Jun 12 2022, PODS 2022 - Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, p. 119-127 9 p. (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
Almost optimal super-constant-pass streaming lower bounds for reachability
Chen, L., Kol, G., Paramonov, D., Saxena, R. R., Song, Z. & Yu, H., Jun 15 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 570-583 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access8 Scopus citations -
Near-optimal two-pass streaming algorithm for sampling random walks over directed graphs
Chen, L., Kol, G., Paramonov, D., Saxena, R. R., Song, Z. & Yu, H., Jul 1 2021, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021. Bansal, N., Merelli, E. & Worrell, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 52. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 198).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
2 Scopus citations -
Tight distributed sketching lower bound for connectivity
Yu, H., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, p. 1856-1873 18 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
3 Scopus citations