2084 search results - page 44 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
151
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
151
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
135
click to vote
CC
2008
Springer
15 years 4 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
162
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
117
click to vote
EPEW
2007
Springer
15 years 10 months ago
2007
Springer
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...