Deterministic size discovery and topology recognition in radio networks with short labels
From MaRDI portal
Publication:6040656
DOI10.1016/j.ic.2023.105010arXiv2105.10595OpenAlexW3164441574WikidataQ120992389 ScholiaQ120992389MaRDI QIDQ6040656
Andrzej Pelc, Mateusz Lewko, Tomasz Jurdziński, Adam Gańczorz
Publication date: 19 May 2023
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.10595
Cites Work
- Topology recognition with advice
- Leader election in ad hoc radio networks: a keen ear helps
- Online computation with advice
- Local MST computation with short advice
- Deterministic communication in radio networks with large labels
- Fast radio broadcasting with advice
- Communication algorithms with advice
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Optimal deterministic broadcasting in known topology radio networks
- Faster communication in known topology radio networks
- Graph reconstruction in the congested clique
- Labeling schemes for deterministic radio multi-broadcast
- Lower and upper bounds for deterministic convergecast with labeling schemes
- Fast broadcasting and gossiping in radio networks
- Deterministic Communication in Radio Networks
- Adjacency Labeling Schemes and Induced-Universal Graphs
- Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
- Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
- Deterministic Graph Exploration with Advice
- Randomized broadcast in radio networks with collision detection
- Short labeling schemes for topology recognition in wireless tree networks
This page was built for publication: Deterministic size discovery and topology recognition in radio networks with short labels
