research
∙
11/25/2022
Towards Better Bounds for Finding Quasi-Identifiers
We revisit the problem of finding small ϵ-separation keys introduced by ...
share
research
∙
08/19/2022
Revisiting Maximum Satisfiability and Related Problems in Data Streams
We revisit the MaxSAT problem in the data stream model. In this problem,...
research
∙
02/16/2021
Maximum Coverage in the Data Stream Model: Parameterized and Generalized
We present algorithms for the Max-Cover and Max-Unique-Cover problems in...
research
∙
09/22/2020
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
Given a graph G=(V,E) with arboricity α, we study the problem of decompo...
research
∙
08/01/2019
Distributed Data Summarization in Well-Connected Networks
We study distributed algorithms for some fundamental problems in data su...
research
∙
07/29/2019
Distributed Dense Subgraph Detection and Low Outdegree Orientation
The maximum density subgraph problem, introduced in the 80s by Picard an...
research
∙
01/02/2019
