Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model

DOI10.1016/S0196-6774(02)00293-6MaRDI QIDQ4808317zbMATH OpenFDO

Authors Wei-Mei Chen, Hsien-Kuei Hwang

Publication date 27 May 2003

Published in Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

normalityAsymptoticDickman distributionAnalysis in distributionBinomial recurrenceBroadcast communication modelMethod of moment

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Recommendations

• Optimal and near-optimal broadcast in random graphs
• A fast maximum finding algorithm on broadcast communication
• A fast maximum finding algorithm on broadcast communication
• An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
• Probabilistic analysis of some distributed algorithms
• scientific article; zbMATH DE number 125893
• Close-to-optimal and near-optimal broadcasting in random graphs
• On the Runtime and Robustness of Randomized Broadcasting
• On the runtime and robustness of randomized broadcasting

Cited in

(6)

• Sorting algorithms for broadcast communications: mathematical analysis.
• On the contraction method with degenerate limit equation.
• An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
• From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
• An analytic approach to the asymptotic variance of trie statistics and related structures
• On strong and almost sure local limit theorems for a probabilistic model of the Dickman distribution

This page was built for publication: Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model

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