Pages that link to "Item:Q1107315"
From MaRDI portal
The following pages link to A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315):
Displaying 5 items.
- New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701) (← links)
- Exact average message complexity values for distributed election on bidirectional rings of processors (Q910221) (← links)
- Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393) (← links)
- Some lower bound results for decentralized extrema-finding in rings of processors (Q2640343) (← links)
- Optimal cost-sensitive distributed minimum spanning tree algorithm (Q5054817) (← links)
