We present a new method for proving strong lower bounds in communication complexity.
This method is based on the notion of the conditional information complexity of a function …

The problem of constructing optimal and near-optimal test sequences to diagnose
permanent faults in electronic and electromechanical systems is considered. The test …

From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …

We consider the classical problem of maximizing a monotone submodular function subject
to a cardinality constraint, which, due to its numerous applications, has recently been …

We study the problem of estimating the maximum matching size in graphs whose edges are
revealed in a streaming manner. We consider both insertion-only streams, which only …

We prove that any one-pass streaming algorithm which (ǫ, δ)-approximates the kth
frequency moment Fk, for any real k= 1 and any ǫ= Ω (1√ m), must use Ω(1∈ 2) bits of …

Edit distance has been extensively studied for the past several years. Nevertheless, no
linear-time algorithm is known to compute the edit distance between two strings, or even to …

In the subgraph counting problem, we are given a input graph $ G (V, E) $ and a target
graph $ H $; the goal is to estimate the number of occurrences of $ H $ in $ G $. Our focus …

The Johnson-Lindenstrauss transform is a dimensionality reduction technique with a wide
range of applications to theoretical computer science. It is specified by a distribution over …

We prove strong lower bounds for the space complexity of (/spl epsi/,/spl delta/)-
approximating the number of distinct elements F/sub 0/in a data stream. Let m be the size of …