Theminimum-degree greedy algorithm, or Greedy for short, is a simple and well-studied method for finding independent sets in graphs. We show that it achieves a performance ratio of (Î”+2)/3 forâ€¦ (More)

We give, for the first time, a precise mathematical analysis of the connectivity and security properties of sensor networks that make use of the random predistribution of keys. We also show how toâ€¦ (More)

We study the static membership problem: Given a set S of at most n keys drawn from a universe of size m, store it so that queries of the form \Is x in S?" can be answered quickly. We study schemesâ€¦ (More)

We show that the size of the smallest depth-two N -superconcentrator is Î˜(N log N/ log logN). Before this work, optimal bounds were known for all depths except two. For the upper bound, we buildâ€¦ (More)

We show lower bounds in the multi-party quantum communicati on complexity model. In this model, there aret parties where theith party has input Xi âŠ† [n]. These parties communicate with each other byâ€¦ (More)

The complexity of maintaining a set under the operations Insert, Delete and FindMin is considered. In the comparison model it is shown that any randomized algorithm with expected amortized cost tâ€¦ (More)

Let <i>X</i> and <i>Y</i> be finite nonempty sets and <i>(X</i>,<i>Y</i>) a pair of random variables taking values in <i>X</i>?<i>Y</i>. We consider communication protocols between two parties,â€¦ (More)