✦ LIBER ✦

The complexity of sorting on distributed systems

✍ Scribed by Michael C. Loui

Book ID: 114037692
Publisher: Elsevier Science
Year: 1984
Weight: 652 KB
Volume: 60
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80022-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Bit Complexity of Distributed Sortin

The Bit Complexity of Distributed Sorting

✍ Gerstel, O.; Zaks, S. 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 135 KB

On the complexity of simple distributed

On the complexity of simple distributed systems

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

On the complexity of topological sorting

✍ Seinosuka Toda 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 498 KB

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 (

Control Communication Complexity of Dist

Control Communication Complexity of Distributed Control Systems

✍ Wong, Wing Shing 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 293 KB

Complexity of sorting by distributive pa

Complexity of sorting by distributive partitioning

✍ Boguslaw L. Jackowski; Ryszard Kubiak; Stefan Sokolowski 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 99 KB