✦ LIBER ✦

A self-stabilizing algorithm for strong fairness

✍ Scribed by M. H. Karaata; P. Chaudhuri

Book ID: 110625327
Publisher: Springer Vienna
Year: 1998
Tongue: English
Weight: 586 KB
Volume: 60
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02684333

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A self-stabilizing algorithm for maximal

A self-stabilizing algorithm for maximal matching

✍ Su-Chu Hsu; Shing-Tsaan Huang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 447 KB

A self-stabilizing algorithm for bridge

A self-stabilizing algorithm for bridge finding

✍ Mehmet Hakan Karaata; Pranay Chaudhuri 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 83 KB

A self-stabilizing enumeration algorithm

✍ Emmanuel Godard 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 99 KB

This paper describes a self-stabilizing version of an algorithm presented by A. Mazurkiewicz [Inform. Process. Lett. 61 (1997) 233-239] for enumerating nodes by local rules on an anonymous network. The result improves the reliability aspects of the original algorithm and underlines the importance of

A self-stabilizing algorithm for colorin

A self-stabilizing algorithm for coloring planar graphs

✍ Sukumar Ghosh; Mehmet Hakan Karaata 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 557 KB

A self-stabilizing algorithm for constru

A self-stabilizing algorithm for constructing spanning trees

✍ Nian-Shing Chen; Hwey-Pyng Yu; Shing-Tsaan Huang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 663 KB

A self-stabilizing algorithm for colorin

A self-stabilizing algorithm for coloring bipartite graphs

✍ Sumit Sur; Pradip K. Srimani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 566 KB