Massively Parallel Maximum Coverage Revisited.
Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025
Revisiting maximum satisfiability and related problems in data streams.
Theor. Comput. Sci., January, 2024
Finding Decision Tree Splits in Streaming and Massively Parallel Models.
CoRR, 2024
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition.
SIAM J. Discret. Math., June, 2023
Towards Better Bounds for Finding Quasi-Identifiers.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023
Maximum Coverage in the Data Stream Model: Parameterized and Generalized.
Proceedings of the 24th International Conference on Database Theory, 2021
Distributed Dense Subgraph Detection and Low Outdegree Orientation.
Proceedings of the 34th International Symposium on Distributed Computing, 2020
Better Streaming Algorithms for the Maximum Coverage Problem.
Theory Comput. Syst., 2019
Distributed Data Summarization in Well-Connected Networks.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019
Towards the locality of Vizing's theorem.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Finding Subcube Heavy Hitters in Analytics Data Streams.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018
Finding Subcube Heavy Hitters in Data Streams.
CoRR, 2017
Better Algorithms for Counting Triangles in Data Streams.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016
Densest Subgraph in Dynamic Graph Streams.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015
Run Generation Revisited: What Goes Up May or May Not Come Down.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
Evaluating Bayesian Networks via Data Streams.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015