( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Better Streaming Algorithms for the Maximum Coverage Problem.

, и . Theory Comput. Syst., 63 (7): 1595-1619 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Vu Dinh Hoa

Nguyen Hoa

Hoang Manh Hung

Hoang quang Luan

Hoang hu'u Tien

 

Другие публикации лиц с тем же именем

Better Streaming Algorithms for the Maximum Coverage Problem., и . ICDT, том 68 из LIPIcs, стр. 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Densest Subgraph in Dynamic Graph Streams., , , и . MFCS (2), том 9235 из Lecture Notes in Computer Science, стр. 472-482. Springer, (2015)Towards Better Bounds for Finding Quasi-Identifiers., , , и . PODS, стр. 155-167. ACM, (2023)Finding Subcube Heavy Hitters in Data Streams., , и . CoRR, (2017)Towards the locality of Vizing's theorem., и . STOC, стр. 355-364. ACM, (2019)Evaluating Bayesian Networks via Data Streams., и . COCOON, том 9198 из Lecture Notes in Computer Science, стр. 731-743. Springer, (2015)Run Generation Revisited: What Goes Up May or May Not Come Down., , , , и . ISAAC, том 9472 из Lecture Notes in Computer Science, стр. 703-714. Springer, (2015)Distributed Dense Subgraph Detection and Low Outdegree Orientation., и . DISC, том 179 из LIPIcs, стр. 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Revisiting Maximum Satisfiability and Related Problems in Data Streams.. COCOON, том 13595 из Lecture Notes in Computer Science, стр. 186-198. Springer, (2022)Finding Decision Tree Splits in Streaming and Massively Parallel Models., , и . CoRR, (2024)