Pages that link to "Item:Q3829068"
From MaRDI portal
The following pages link to The Bit Complexity of Randomized Leader Election on a Ring (Q3829068):
Displaying 12 items.
- Anonymous wireless rings (Q673090) (← 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)
- Symmetry breaking in distributed networks (Q918187) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Improved bounds for electing a leader in a synchronous ring (Q1355728) (← links)
- Two absolute bounds for distributed bit complexity (Q2382670) (← links)
- Simplifying Itai-Rodeh leader election for anonymous rings (Q2848414) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Structural Information and Communication Complexity (Q5710078) (← links)
- The topology of randomized symmetry-breaking distributed computing (Q6645915) (← links)