2084 search results - page 75 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SAC
2009
ACM
15 years 4 months ago
2009
ACM
We consider distributed real-time systems where concurrency control is managed using software transactional memory. For such a method we propose an algorithm to compute an upper b...
FOCS
1989
IEEE
15 years 1 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
SOFSEM
1997
Springer
15 years 1 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
100
click to vote
CPC
2006
14 years 9 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
FORTE
2007
14 years 11 months ago
2007
Abstract. We present a formal specification and analysis of a faulttolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorith...