Sorting algorithms for broadcast communications: mathematical analysis

@article{Grabner2002SortingAF,
  title={Sorting algorithms for broadcast communications: mathematical analysis},
  author={Peter J. Grabner and Helmut Prodinger},
  journal={Theor. Comput. Sci.},
  year={2002},
  volume={289},
  pages={51-67}
}
We study three algorithms for sorting under the broadcast communication model. Two algorithms are based on the maximum finding and the loser selection strategy, the third one is the naive strategy based on loser selection only. While a precise description of the algorithms can be found in the paper [15], we concentrate here on the mathematical aspects of the analysis. From these elementary considerations it follows that the average time complexities of the non-naive algorithms are Θ(n). We give… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 10 CITATIONS

Resolving Conflicts and Electing Leaders

  • ArXiv
  • 2019
VIEW 12 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Green Mining: toward a less energetic impact of cryptocurrencies

  • IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

A Novel Energy Efficient Broadcast Leader Election

  • 2013 IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND