Author of the publication

Better Streaming Algorithms for the Maximum Coverage Problem.

, and . 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Better Streaming Algorithms for the Maximum Coverage Problem., and . ICDT, volume 68 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Densest Subgraph in Dynamic Graph Streams., , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 472-482. Springer, (2015)Towards Better Bounds for Finding Quasi-Identifiers., , , and . PODS, page 155-167. ACM, (2023)Finding Subcube Heavy Hitters in Data Streams., , and . CoRR, (2017)Towards the locality of Vizing's theorem., and . STOC, page 355-364. ACM, (2019)Evaluating Bayesian Networks via Data Streams., and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 731-743. Springer, (2015)Finding Subcube Heavy Hitters in Analytics Data Streams., , , and . WWW, page 1705-1714. ACM, (2018)Better Algorithms for Counting Triangles in Data Streams., , and . PODS, page 401-411. ACM, (2016)Distributed Data Summarization in Well-Connected Networks., and . DISC, volume 146 of LIPIcs, page 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Run Generation Revisited: What Goes Up May or May Not Come Down., , , , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 703-714. Springer, (2015)