research
∙
11/21/2022
Expander Decomposition in Dynamic Streams
In this paper we initiate the study of expander decompositions of a grap...
share
research
∙
11/21/2022
Toeplitz Low-Rank Approximation with Sublinear Query Complexity
We present a sublinear query algorithm for outputting a near-optimal low...
research
∙
04/21/2022
Motif Cut Sparsifiers
A motif is a frequently occurring subgraph of a given directed or undire...
research
∙
07/15/2021
