| 2026 | ESA | Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams. | Hoang Ta, Hoa T. Vu |
| 2025 | ISIT | Constructing Decision Trees from Data Streams. | Huy Pham, Hoang Ta, Hoa T. Vu |
| 2025 | SOFSEM | Massively Parallel Maximum Coverage Revisited. | Thai Bui, Hoa T. Vu |
| 2023 | PODS | Towards Better Bounds for Finding Quasi-Identifiers. | Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta, Hoa T. Vu |
| 2022 | COCOON | Revisiting Maximum Satisfiability and Related Problems in Data Streams. | Hoa T. Vu |
| 2021 | ICDT | Maximum Coverage in the Data Stream Model: Parameterized and Generalized. | Andrew McGregor, David Tench, Hoa T. Vu |
| 2021 | PODC | On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. | David G. Harris, Hsin-Hao Su, Hoa T. Vu |
| 2019 | STOC | Towards the locality of Vizing's theorem. | Hsin-Hao Su, Hoa T. Vu |
| 2018 | WWW | Finding Subcube Heavy Hitters in Analytics Data Streams. | Branislav Kveton, S. Muthukrishnan, Hoa T. Vu, Yikun Xian |
| 2017 | ICDT | Better Streaming Algorithms for the Maximum Coverage Problem. | Andrew McGregor, Hoa T. Vu |
| 2016 | PODS | Better Algorithms for Counting Triangles in Data Streams. | Andrew McGregor, Sofya Vorotnikova, Hoa T. Vu |
| 2015 | COCOON | Evaluating Bayesian Networks via Data Streams. | Andrew McGregor, Hoa T. Vu |
| 2015 | ISAAC | Run Generation Revisited: What Goes Up May or May Not Come Down. | Michael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh, Hoa T. Vu |
| 2015 | MFCS | Densest Subgraph in Dynamic Graph Streams. | Andrew McGregor, David Tench, Sofya Vorotnikova, Hoa T. Vu |