Pages that link to "Item:Q1355728"
From MaRDI portal
The following pages link to Improved bounds for electing a leader in a synchronous ring (Q1355728):
Displaying 10 items.
- Bit-optimal election in synchronous rings (Q916342) (← links)
- Electing a leader in a ring with link failures (Q1075046) (← links)
- New protocols for the election of a leader in a ring (Q1092653) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Tight bounds for synchronous communication of information using bits and silence (Q1399118) (← links)
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings (Q1954232) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- The Bit Complexity of Randomized Leader Election on a Ring (Q3829068) (← links)
- Optimal Time–Space Tradeoff for Shared Memory Leader Election (Q4366876) (← links)
- On the Microscopic View of Time and Messages (Q4686647) (← links)