2084 search results - page 111 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
105
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
117
Voted
PODC
2005
ACM
15 years 8 months ago
2005
ACM
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, c...
175
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
121
Voted
STACS
2005
Springer
15 years 8 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
128
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— We present a novel observer design for a class of single-output nonlinear systems with Markov jumps. The Markov jump process interferes with a deterministic nonlinear dynamics ...