This survey highlights the recent advances in algorithms for numerical linear algebra that
have come from the technique of linear sketching, whereby given a matrix, one first …

We consider relative error low rank approximation of tensors with respect to the Frobenius
norm. Namely, given an order-q tensor A∊ ℝ∏ i= 1 q ni, output a rank-k tensor B for which …

Refactorings are behavior-preserving program transformations that automate design
evolution in object-oriented applications. Three kinds of design evolution are: schema …

In the adversarially robust streaming model, a stream of elements is presented to an
algorithm and is allowed to depend on the output of the algorithm at earlier times during the …

The streaming model of computation is a popular approach for working with large-scale
data. In this setting, there is a stream of items and the goal is to compute the desired …

The notion of L p sampling, and corresponding algorithms known as L p samplers, has
found a wide range of applications in the design of data stream algorithms and beyond. In …

We study the Kronecker product regression problem, in which the design matrix is a
Kronecker product of two or more matrices. Formally, given $ A_i\in\R^{n_i\times d_i} $ for …

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 …

We develop a new algorithm for the turnstile heavy hitters problem in general turnstile
streams, the EXPANDERSKETCH, which finds the approximate top-k items in a universe of …

In the turnstile model of data streams, an underlying vector x∈{--m,--m+ 1,..., m--1, m} n is
presented as a long sequence of positive and negative integer updates to its coordinates. A …