In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

“Ogni lassada xe persa.” 1--Proverb from Trieste, Italy. We present trièst, a suite of one-pass
streaming algorithms to compute unbiased, low-variance, high-quality approximations of the …

There is a rapidly growing need for scalable algorithms that solve classical graph problems,
such as maximum matching and minimum vertex cover, on massive graphs. For massive …

We present space-efficient data stream algorithms for approximating the number of triangles
in a graph up to a factor 1+ ε. While it can be shown that determining whether a graph is …

Bipartite graphs are of great importance in many real-world applications. Butterfly, which is a
complete 2× 2 biclique, plays a key role in bipartite graphs. In this paper, we investigate the …

We study space-pass tradeoffs in graph streaming algorithms for parameter estimation and
property testing problems such as estimating the size of maximum matchings and maximum …

We prove that any two-pass graph streaming algorithm for the st reachability problem in n-
vertex directed graphs requires near-quadratic space of n 2-o (1) bits. As a corollary, we also …

Consider the following gap cycle counting problem in the streaming model: The edges of a 2-
regular n-vertex graph G are arriving one-by-one in a stream and we are promised that G is …

We prove a lower bound on the space complexity of two-pass semi-streaming algorithms
that approximate the maximum matching problem. The lower bound is parameterized by the …