TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION

DOI10.1142/S0129054104002315MaRDI QIDQ5696966zbMATH OpenOpenAlexFDO

Authors Koji Nakano

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

zbMATH Keywords

communication channels

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

Cites work

Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
Deterministic coin tossing with applications to optimal parallel list ranking
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
Efficient list ranking on the reconfigurable mesh, with applications
scientific article; zbMATH DE number 43583 (Why is no real title available?)
scientific article; zbMATH DE number 52113 (Why is no real title available?)
scientific article; zbMATH DE number 107951 (Why is no real title available?)
Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization

Cited in

(1)

scientific article; zbMATH DE number 2089982 (Why is no real title available?)

This page was built for publication: TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696966)