research
∙
11/08/2022
Streaming beyond sketching for Maximum Directed Cut
We give an O(√(n))-space single-pass 0.483-approximation streaming algor...
share
research
∙
09/12/2022
An Improved Lower Bound for Matroid Intersection Prophet Inequalities
We consider prophet inequalities subject to feasibility constraints that...
research
∙
07/14/2022
Streaming complexity of CSPs with randomly ordered constraints
We initiate a study of the streaming complexity of constraint satisfacti...
research
∙
12/29/2020
Exponential Communication Separations between Notions of Selfishness
We consider the problem of implementing a fixed social choice function b...
research
∙
11/14/2020
Separating the Communication Complexity of Truthful and Non-Truthful Combinatorial Auctions
We provide the first separation in the approximation guarantee achievabl...
research
∙
09/07/2020
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
Consider the following gap cycle counting problem in the streaming model...
research
∙
09/08/2019
Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility
We study the Convex Set Disjointness (CSD) problem, where two players ha...
research
∙
11/06/2017