535 search results - page 5 / 107 » Checking Computations in Polylogarithmic Time |
ESA
2004
Springer
14 years 9 days ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
CONCUR
1995
Springer
13 years 10 months ago
1995
Springer
PRDC
2007
IEEE
14 years 1 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
EUROPAR
2004
Springer
14 years 9 days ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
PODC
2006
ACM
14 years 26 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...