Sorting algorithms for broadcast communications: mathematical analysis.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1696641
- Distributed selectsort sorting algorithms on broadcast communication networks
- Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
- The complexity of sorting on distributed systems
- Optimal Distributed Algorithms for Sorting and Ranking
Cites work
- scientific article; zbMATH DE number 1696641 (Why is no real title available?)
- scientific article; zbMATH DE number 3814037 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- A fast maximum finding algorithm on broadcast communication
- A zero-density theorem for the Riemann zeta-function
- AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
- Analysis of an asymmetric leader election algorithm
- How to select a loser
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- On the distribution for the duration of a randomized leader election algorithm
- Searching for losers
Cited in
(4)
This page was built for publication: Sorting algorithms for broadcast communications: mathematical analysis.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853542)