The following pages link to How to select a loser (Q687117):
Displaying 30 items.
- Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution (Q292352) (← links)
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication (Q293191) (← links)
- The asymmetric leader election algorithm: another approach (Q659767) (← links)
- On tries, contention trees and their analysis (Q659773) (← links)
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- Mellin transforms and asymptotics: Finite differences and Rice's integrals (Q672985) (← links)
- Quasi-optimal energy-efficient leader election algorithms in radio networks (Q879595) (← links)
- Analytical depoissonization and its applications (Q1129001) (← links)
- On the distribution for the duration of a randomized leader election algorithm (Q1354843) (← links)
- Normal limiting distribution of the size of binary interval trees (Q1666510) (← links)
- Sorting algorithms for broadcast communications: mathematical analysis. (Q1853542) (← links)
- One-sided variations on binary search trees (Q1881001) (← links)
- Paths in \(m\)-ary interval trees (Q1886340) (← links)
- On the contraction method with degenerate limit equation. (Q1889801) (← links)
- Explicit and asymptotic formulae for the expected values of the order statistics of the Cantor distribution (Q1916189) (← links)
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (Q2345463) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- Survivors in leader election algorithms (Q2439651) (← links)
- On a leader election algorithm: truncated geometric case study (Q2452871) (← links)
- Asymptotic analysis of a leader election algorithm (Q2503299) (← links)
- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications (Q2868641) (← links)
- Leader election using random walks (Q2954460) (← links)
- Asymptotic Properties of a Leader Election Algorithm (Q3014993) (← links)
- Searching for losers (Q4034711) (← links)
- One-sided variations on interval trees (Q4462695) (← links)
- From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader (Q4684848) (← links)
- How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems (Q5204318) (← links)
- The asymmetric leader election algorithm: Number of survivors near the end of the game (Q5233905) (← links)
- Perpetuities in Fair Leader Election Algorithms (Q5415100) (← links)
- Profile of Tries (Q5458512) (← links)
