Pages that link to "Item:Q3765249"
From MaRDI portal
The following pages link to Lower Bounds for Distributed Maximum-Finding Algorithms (Q3765249):
Displaying 20 items.
- A simple, efficient algorithm for maximum finding on rings (Q671266) (← links)
- Message terminating algorithms for anonymous rings of unknown size (Q673475) (← links)
- Two lower bounds in asynchronous distributed computation (Q808249) (← links)
- New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701) (← links)
- Bit-optimal election in synchronous rings (Q916342) (← links)
- Randomized function evaluation on a ring (Q916384) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Language complexity on the synchronous anonymous ring (Q1102125) (← links)
- A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315) (← links)
- Distributed election in complete networks (Q1112606) (← links)
- Towards optimal distributed election on chordal rings (Q1178237) (← links)
- Efficient elections in chordal ring networks (Q1262125) (← links)
- Fast leader election in anonymous rings with bounded expected delay (Q1944153) (← links)
- Some lower bound results for decentralized extrema-finding in rings of processors (Q2640343) (← links)
- On the message complexity of distributed problems (Q3345763) (← links)
- Asymptotically Optimal Election on Weighted Rings (Q4210174) (← links)
- Asymptotically optimal election on weighted rings (Q5054762) (← links)
- Optimal cost-sensitive distributed minimum spanning tree algorithm (Q5054817) (← links)
- Time vs bits (Q5096162) (← links)
- Sense of direction in processor networks (Q6573924) (← links)
