Pages that link to "Item:Q498667"
From MaRDI portal
The following pages link to Knowledge, level of symmetry, and time of leader election (Q498667):
Displaying 9 items.
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Distinguishing views in symmetric networks: a tight lower bound (Q2342668) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? (Q2835014) (← links)
- (Q2912867) (redirect page) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
