Property testing is concerned with the design of super-fast algorithms for the structural
analysis of large quantities of data. The aim is to unveil global features of the data, such as …

The centralized coded caching scheme is a technique proposed by Maddah-Ali and Niesen
as a method to reduce the network burden in peak times in a wireless network system. Yan …

Recent Advances in Multi-Pass Graph Streaming Lower Bounds Page 1 Recent Advances in
Multi-Pass Graph Streaming Lower Bounds Sepehr Assadi Cheriton School of Computer …

A common thread in recent results concerning the testing of dense graphs is the use of
Szemerédi's regularity lemma. In this paper we show that in some sense this is not a …

In this paper we study a generalization of standard property testing where the algorithms are
required to be more tolerant with respect to objects that do not have, but are close to having …

Consider the following communication problem. Alice holds a graph GA=(P, Q, EA) and Bob
holds a graph GB=(P, Q, EB), where| P|=| Q|= n. Alice is allowed to send Bob a message m …

Property testing is a new field in computational theory, that deals with the information that
can be deduced from the input where the number of allowable queries (reads from the input) …

Property testing algorithms are" ultra"-efficient algorithms that decide whether a given object
(eg, a graph) has a certain property (eg, bipartiteness), or is significantly different from any …

We present a new approach for finding matchings in dense graphs by building on
Szemerédi's celebrated Regularity Lemma. This allows us to obtain non-trivial albeit slight …

In this paper we present improved bounds for approximating maximum matchings in
bipartite graphs in the streaming model. First, we consider the question of how well …