Pages that link to "Item:Q808701"
From MaRDI portal
The following pages link to New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701):
Displaying 12 items.
- Some problems in distributed computational geometry (Q719317) (← links)
- Two lower bounds in asynchronous distributed computation (Q808249) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Average number of messages for distributed leader-fitting in rings of processors (Q1117694) (← links)
- Fast leader election in anonymous rings with bounded expected delay (Q1944153) (← links)
- Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393) (← links)
- Finding the extrema of a distributed multiset (Q2563978) (← links)
- Some lower bound results for decentralized extrema-finding in rings of processors (Q2640343) (← links)
- The distributed bit complexity of the ring: From the anonymous to the non-anonymous case (Q3974855) (← links)
- Average number of messages for distributed leader finding in rings of processors (Q5096161) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION (Q5248973) (← links)
