Evaluating Bayesian Networks via Data Streams. - Andrew McGregor 001; Hoa T. Vu (COCOON, 2015)

Run Generation Revisited: What Goes Up May or May Not Come Down. - Michael A. Bender; Samuel McCauley; Andrew McGregor 001; Shikha Singh 002; Hoa T. Vu (ISAAC, 2015)

Densest Subgraph in Dynamic Graph Streams. - Andrew McGregor 001; David Tench; Sofya Vorotnikova; Hoa T. Vu (MFCS (2), 2015)

Better Algorithms for Counting Triangles in Data Streams. - Andrew McGregor 001; Sofya Vorotnikova; Hoa T. Vu (PODS, 2016)

Finding Subcube Heavy Hitters in Data Streams. - Branislav Kveton; S. Muthukrishnan 001; Hoa T. Vu (CoRR, 2017)

Finding Subcube Heavy Hitters in Analytics Data Streams. - Branislav Kveton; S. Muthukrishnan 001; Hoa T. Vu; Yikun Xian (WWW, 2018)

Towards the locality of Vizing's theorem. - Hsin-Hao Su; Hoa T. Vu (STOC, 2019)

Distributed Data Summarization in Well-Connected Networks. - Hsin-Hao Su; Hoa T. Vu (DISC, 2019)

Better Streaming Algorithms for the Maximum Coverage Problem. - Andrew McGregor 001; Hoa T. Vu (Theory Comput. Syst., 2019)

Distributed Dense Subgraph Detection and Low Outdegree Orientation. - Hsin-Hao Su; Hoa T. Vu (DISC, 2020)

Maximum Coverage in the Data Stream Model: Parameterized and Generalized. - Andrew McGregor 001; David Tench; Hoa T. Vu (ICDT, 2021)

Towards Better Bounds for Finding Quasi-Identifiers. - Ryan Hildebrant; Quoc-Tung Le; Duy-Hoang Ta 001; Hoa T. Vu (PODS, 2023)

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. - David G. Harris 001; Hsin-Hao Su; Hoa T. Vu (SIAM J. Discret. Math., 2023)

Finding Decision Tree Splits in Streaming and Massively Parallel Models. - Huy Pham; Hoang Ta 001; Hoa T. Vu (CoRR, 2024)

Revisiting maximum satisfiability and related problems in data streams. - Hoa T. Vu (Theor. Comput. Sci., 2024)

Massively Parallel Maximum Coverage Revisited. - Thai Bui; Hoa T. Vu (SOFSEM (1), 2025)

Fast and Simple Densest Subgraph with Predictions. - Thai Bui; Hoa T. Vu (CoRR, 2025)