research
∙
12/20/2022
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms
In recent years, there has been a growing interest in solving various gr...
share
research
∙
12/21/2021
Counting Simplices in Hypergraph Streams
We consider the problem of space-efficiently estimating the number of si...
research
∙
09/23/2021
Adversarially Robust Coloring for Graph Streams
A streaming algorithm is considered to be adversarially robust if it pro...
research
∙
07/13/2021
The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries
Two widely-used computational paradigms for sublinear algorithms are usi...
research
∙
05/18/2021
Vertex Ordering Problems in Directed Graph Streams
We consider directed graph algorithms in a streaming setting, focusing o...
research
∙
07/06/2020
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches
We study graph computations in an enhanced data streaming setting, where...
research
∙
05/02/2019
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models
We study the problem of coloring a given graph using a small number of c...
research
∙
12/04/2017
