Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution
From MaRDI portal
Publication:292352
DOI10.1007/S11009-014-9428-1zbMath1386.60040OpenAlexW2020138569MaRDI QIDQ292352
Publication date: 8 June 2016
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-014-9428-1
weak convergencerandomized algorithmMarshall-Olkin distributionstochastic recurrenceRice's integral method
Analysis of algorithms (68W40) Probability distributions: general theory (60E05) Combinatorial probability (60C05)
Cites Work
- The asymmetric leader election algorithm: another approach
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- How to select a loser
- Marshall and Olkin's distributions
- On the distribution for the duration of a randomized leader election algorithm
- Analysis of an asymmetric leader election algorithm
- Number of survivors in the presence of a demon
- Survivors in leader election algorithms
- On a leader election algorithm: truncated geometric case study
- On a multivariate contraction method for random recursive structures with applications to Quicksort
- Asymptotic Properties of a Leader Election Algorithm
- Convergence of some leader election algorithms
- A Family of Bivariate Distributions Generated by the Bivariate Bernoulli Distribution
- The Swedish Leader Election Protocol: Analysis and Variations
- Perpetuities in Fair Leader Election Algorithms
This page was built for publication: Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution