✦ LIBER ✦

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification

✍ Scribed by Liah Kor, Amos Korman, David Peleg

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distributed verification of minimum span

✍ Amos Korman; Shay Kutten 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 328 KB

A Near-Tight Lower Bound on the Time Com

✍ Peleg, David; Rubinovich, Vitaly 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 250 KB

A Distributed Algorithm for Minimum-Weig

✍ Gallager, R. G.; Humblet, P. A.; Spira, P. M. 📂 Article 📅 1983 🏛 Association for Computing Machinery 🌐 English ⚖ 745 KB

A Distributed Algorithm for Minimum Weig

✍ Humblet, P. 📂 Article 📅 1983 🏛 IEEE 🌐 English ⚖ 700 KB

An Inverse-Ackermann Type Lower Bound Fo

✍ Seth Pettie† 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 382 KB

A SubLinear Time Distributed Algorithm f

✍ Garay, Juan A.; Kutten, Shay; Peleg, David 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 272 KB