TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
From MaRDI portal
Publication:5696966
DOI10.1142/S0129054104002315zbMath1075.68538OpenAlexW1972176971MaRDI QIDQ5696966
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054104002315
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Efficient list ranking on the reconfigurable mesh, with applications
- Deterministic coin tossing with applications to optimal parallel list ranking
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
This page was built for publication: TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
