We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the two model are essentially equal. Communicationâ€¦ (More)

In this paper we study the Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos; a problem which gives a nice clean combinatorial formulation for many applications arising inâ€¦ (More)

The field of property testing studies algorithms that distinguish, using a small number of queries, between inputs which satisfy a given property, and those that are `far' from satisfying theâ€¦ (More)

A language <i>L</i> has a property tester if there exists a probabilistic algorithm that given an input <i>x</i> only asks a small number of bits of <i>x</i> and distinguishes the cases as to whetherâ€¦ (More)

We consider a fault tolerance broadcast network of n processors each holding one bit of information. The goal is to compute a given Boolean function on the n bits. In each step, a processor mayâ€¦ (More)