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

A2.5nlower bound on the monotone network complexity ofT3n

โœ Scribed by Paul E. Dunne


Publisher
Springer-Verlag
Year
1985
Tongue
English
Weight
446 KB
Volume
22
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Complexity of Distributed Network
โœ 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