✦ LIBER ✦

On the bit complexity of distributed computations in a ring with a leader

✍ Scribed by Y. Mansour; S. Zaks

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bit complexity of order statistics on a

✍ O. Gerstel; Y. Mansour; S. Zaks 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 881 KB

A note on the number of N-bit strings wi

✍ G.J. Chaitin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 187 KB

New protocols for the election of a lead

✍ A. Marchetti-Spaccamela 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 718 KB

A better lower bound for distributed lea

✍ Hans L. Bodlaender 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 318 KB

What is the complexity of a distributed

✍ Anand Ranganathan; Roy H. Campbell 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

On the complexity of deadlock-free progr

✍ W. Edwin Clark; Gregory L. McColm; W. Richard Stark 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 459 KB