Pages that link to "Item:Q4962669"
From MaRDI portal
The following pages link to Time vs. Information Tradeoffs for Leader Election in Anonymous Trees (Q4962669):
Displaying 7 items.
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- Lower and upper bounds for deterministic convergecast with labeling schemes (Q2693630) (← links)
- Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
- Deterministic size discovery and topology recognition in radio networks with short labels (Q6040656) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
