✦ LIBER ✦

On the message complexity of distributed problems

✍ Scribed by Nicola Santoro

Publisher: Springer
Year: 1984
Tongue: English
Weight: 736 KB
Volume: 13
Category: Article
ISSN: 1573-7640
DOI: 10.1007/bf00979869

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the impact of sense of direction on m

On the impact of sense of direction on message complexity

✍ Paola Flocchini; Bernard Mans; Nicola Santoro 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 859 KB

In this paper, we prove a general result on the impact of sense of direction. We show that, in arbitrary graphs, any sense of direction has a dramatic effect on the communication complexity of several important distributed problems: Broadcast, Depth First Traversal, Election, and Spanning Tree Const

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

On the expected complexity of distribute

On the expected complexity of distributed selection

✍ Nicola Santoro; Michael Scheutzow; Jeffrey B. Sidney 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Minimizing message complexity of partial

Minimizing message complexity of partially replicated data on hypercubes

✍ Humenik, Keith; Matthews, Peter; Stephens, A. B.; Yesha, Yelena 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 663 KB

Within the framework of distributed and parallel computing, we consider partially replicated data on a hypercube. We address the problem of placing copies on the hypercube in order to minimize message complexity. With realistic restrictions on the read/write ratio and the number of copies, we find t

On the complexity of tree embedding prob

On the complexity of tree embedding problems

✍ Shai Simonson; I.Hal Sudborough 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 534 KB

On the average complexity of multivariat

On the average complexity of multivariate problems

✍ A Papageorgiou; G.W Wasilkowski 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 904 KB

We study the average complexity of linear problems, on a separable Banach space equipped with an orthogonally invariant measure CL. The error and the cost of the algorithms are defined on the average. We exhibit an information operator which is optimal among any linear information operators. We appl