✦ LIBER ✦

On the complexity of designing distributed protocols

✍ Scribed by Christos H. Papadimitriou; John Tsitsiklis

Book ID: 114037634
Publisher: Elsevier Science
Year: 1982
Weight: 410 KB
Volume: 53
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(82)91034-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the message complexity of distributed

On the message complexity of distributed problems

✍ Nicola Santoro 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 736 KB

On the complexity of simple distributed

On the complexity of simple distributed systems

✍ van Steen, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 144 KB

The complexity of sorting on distributed

The complexity of sorting on distributed systems

✍ Michael C. Loui 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 652 KB

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

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 Amortized Complexity of Zero-Know

On the Amortized Complexity of Zero-Knowledge Protocols

✍ Ronald Cramer, Ivan Damgård, Marcel Keller 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 449 KB