Pages that link to "Item:Q1176439"
From MaRDI portal
The following pages link to Communication and time complexity of a distributed election protocol (Q1176439):
Displaying 3 items.
- Exact average message complexity values for distributed election on bidirectional rings of processors (Q910221) (← links)
- Fast leader election in anonymous rings with bounded expected delay (Q1944153) (← links)
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks (Q3210138) (← links)