๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the expected complexity of distributed selection

โœ Scribed by Nicola Santoro; Michael Scheutzow; Jeffrey B. Sidney

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
562 KB
Volume
5
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Complexity of Distributed Network
On the Complexity of Distributed Network Decomposition
โœ Alessandro Panconesi; Aravind Srinivasan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 200 KB

In this paper, we improve the bounds for computing a network decomposition ลฝ โ‘€ ลฝ n. โ‘€ ลฝ n. . distributively and deterministically. Our algorithm computes an n , n - ## ลฝ . decomposition in n time, where โ‘€ n s 1r log n . As a corollary we obtain ' improved deterministic bounds for distributively c

The computational complexity of the reli
The computational complexity of the reliability problem on distributed systems
โœ Min-Sheng Lin; Deng-Jyi Chen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 450 KB

The reliability of a distributed program in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote data files will be executed successfully. This reliability varies according to (