Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connec...
Shengshan Cui, Alexander M. Haimovich, Oren Somekh...