default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHoa T. Vu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Hoa T. Vu
:
Revisiting maximum satisfiability and related problems in data streams. Theor. Comput. Sci. 982: 114271 (2024)- [i13]Huy Pham, Hoang Ta, Hoa T. Vu:
Finding Decision Tree Splits in Streaming and Massively Parallel Models. CoRR abs/2403.19867 (2024) - [i12]Thai Bui, Hoa T. Vu:
Massively Parallel Maximum Coverage Revisited. CoRR abs/2411.11277 (2024) - 2023
- [j2]David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. SIAM J. Discret. Math. 37(2): 800-830 (2023) - [c13]Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta, Hoa T. Vu:
Towards Better Bounds for Finding Quasi-Identifiers. PODS 2023: 155-167 - 2022
- [c12]Hoa T. Vu:
Revisiting Maximum Satisfiability and Related Problems in Data Streams. COCOON 2022: 186-198 - [i11]Hoa T. Vu:
Revisiting Maximum Satisfiability and Related Problems in Data Streams. CoRR abs/2208.09160 (2022) - [i10]Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta, Hoa T. Vu:
Towards Better Bounds for Finding Quasi-Identifiers. CoRR abs/2211.13882 (2022) - 2021
- [c11]Andrew McGregor, David Tench, Hoa T. Vu:
Maximum Coverage in the Data Stream Model: Parameterized and Generalized. ICDT 2021: 12:1-12:20 - [c10]David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. PODC 2021: 295-305 - [i9]Andrew McGregor, David Tench, Hoa T. Vu:
Maximum Coverage in the Data Stream Model: Parameterized and Generalized. CoRR abs/2102.08476 (2021) - 2020
- [c9]Hsin-Hao Su, Hoa T. Vu:
Distributed Dense Subgraph Detection and Low Outdegree Orientation. DISC 2020: 15:1-15:18 - [i8]David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. CoRR abs/2009.10761 (2020)
2010 – 2019
- 2019
- [j1]Andrew McGregor, Hoa T. Vu:
Better Streaming Algorithms for the Maximum Coverage Problem. Theory Comput. Syst. 63(7): 1595-1619 (2019) - [c8]Hsin-Hao Su, Hoa T. Vu:
Towards the locality of Vizing's theorem. STOC 2019: 355-364 - [c7]Hsin-Hao Su, Hoa T. Vu:
Distributed Data Summarization in Well-Connected Networks. DISC 2019: 33:1-33:16 - [i7]Hsin-Hao Su, Hoa T. Vu:
Towards the Locality of Vizing's Theorem. CoRR abs/1901.00479 (2019) - [i6]Hsin-Hao Su, Hoa T. Vu:
Distributed Dense Subgraph Detection and Low Outdegree Orientation. CoRR abs/1907.12443 (2019) - [i5]Hsin-Hao Su, Hoa T. Vu:
Distributed Data Summarization in Well-Connected Networks. CoRR abs/1908.00236 (2019) - 2018
- [c6]Branislav Kveton, S. Muthukrishnan, Hoa T. Vu, Yikun Xian:
Finding Subcube Heavy Hitters in Analytics Data Streams. WWW 2018: 1705-1714 - 2017
- [c5]Andrew McGregor, Hoa T. Vu:
Better Streaming Algorithms for the Maximum Coverage Problem. ICDT 2017: 22:1-22:18 - [i4]Branislav Kveton, S. Muthukrishnan, Hoa T. Vu:
Finding Subcube Heavy Hitters in Data Streams. CoRR abs/1708.05159 (2017) - 2016
- [c4]Andrew McGregor, Sofya Vorotnikova, Hoa T. Vu:
Better Algorithms for Counting Triangles in Data Streams. PODS 2016: 401-411 - [i3]Andrew McGregor, Hoa T. Vu:
Better Streaming Algorithms for the Maximum Coverage Problem. CoRR abs/1610.06199 (2016) - 2015
- [c3]Andrew McGregor, Hoa T. Vu:
Evaluating Bayesian Networks via Data Streams. COCOON 2015: 731-743 - [c2]Michael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh, Hoa T. Vu:
Run Generation Revisited: What Goes Up May or May Not Come Down. ISAAC 2015: 703-714 - [c1]Andrew McGregor, David Tench, Sofya Vorotnikova, Hoa T. Vu:
Densest Subgraph in Dynamic Graph Streams. MFCS (2) 2015: 472-482 - [i2]Michael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh, Hoa T. Vu:
Run Generation Revisited: What Goes Up May or May Not Come Down. CoRR abs/1504.06501 (2015) - [i1]Andrew McGregor, David Tench, Sofya Vorotnikova, Hoa T. Vu:
Densest Subgraph in Dynamic Graph Streams. CoRR abs/1506.04417 (2015)
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 2025-01-09 13:22 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:
