Sorting algorithms for broadcast communications: mathematical analysis.

DOI10.1016/S0304-3975(01)00114-1zbMath1061.68073OpenAlexW2057352619MaRDI QIDQ1853542

Peter J. Grabner, Prodinger, Helmut

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00114-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items

An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ On binary search tree recursions with monomials as toll functions ⋮ Binary search tree recursions with harmonic toll functions

Cites Work

• An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• How to select a loser
• A zero-density theorem for the Riemann zeta-function
• A fast maximum finding algorithm on broadcast communication
• On the distribution for the duration of a randomized leader election algorithm
• Analysis of an asymmetric leader election algorithm
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• Searching for losers
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item