Sciweavers

PODC
2006
ACM
13 years 11 months ago
Sketching asynchronous streams over a sliding window
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
Srikanta Tirthapura, Bojian Xu, Costas Busch
PODC
2006
ACM
13 years 11 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
PODC
2006
ACM
13 years 11 months ago
Peer counting and sampling in overlay networks: random walk methods
Laurent Massoulié, Erwan Le Merrer, Anne-Ma...
PODC
2006
ACM
13 years 11 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
PODC
2006
ACM
13 years 11 months ago
Reliable broadcast in radio networks: the bounded collision case
Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Ni...
PODC
2006
ACM
13 years 11 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
PODC
2006
ACM
13 years 11 months ago
Timeliness, failure-detectors, and consensus performance
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Idit Keidar, Alexander Shraer
PODC
2006
ACM
13 years 11 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
PODC
2006
ACM
13 years 11 months ago
An O(1) RMRs leader election algorithm
Wojciech M. Golab, Danny Hendler, Philipp Woelfel