How to select a loser
From MaRDI portal
Publication:687117
DOI10.1016/0012-365X(93)90572-BzbMath0795.90103MaRDI QIDQ687117
Publication date: 22 September 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
One-sided variations on binary search trees, Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution, An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication, Paths in \(m\)-ary interval trees, On the contraction method with degenerate limit equation., On the distribution for the duration of a randomized leader election algorithm, Explicit and asymptotic formulae for the expected values of the order statistics of the Cantor distribution, Normal limiting distribution of the size of binary interval trees, Quasi-optimal energy-efficient leader election algorithms in radio networks, Analytical depoissonization and its applications, Searching for losers, An analytic approach to the asymptotic variance of trie statistics and related structures, Survivors in leader election algorithms, On a leader election algorithm: truncated geometric case study, The asymmetric leader election algorithm: another approach, On tries, contention trees and their analysis, Mellin transforms and asymptotics: Harmonic sums, Mellin transforms and asymptotics: Finite differences and Rice's integrals, Asymptotic Properties of a Leader Election Algorithm, Perpetuities in Fair Leader Election Algorithms, Asymptotic analysis of a leader election algorithm, From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader, How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems, Profile of Tries, One-sided variations on interval trees, The asymmetric leader election algorithm: Number of survivors near the end of the game, Leader election using random walks, Sorting algorithms for broadcast communications: mathematical analysis., Analysis of fully distributed splitting and naming probabilistic procedures and applications, Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications
Cites Work
- The evaluation of an alternative sum with applications to the analysis of some data structures
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- Digital Search Trees Revisited
- Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms
- Unnamed Item
- Unnamed Item
