Searching for losers

DOI10.1002/rsa.3240040107zbMath0788.60020OpenAlexW2092755714MaRDI QIDQ4034711

Peter J. Grabner

Publication date: 16 May 1993

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240040107

zbMATH Keywords

asymptotical solutions of a special type of bivariate recurrencesaverage number of coin flippingsflipping coins

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (4)

On the distribution for the duration of a randomized leader election algorithm ⋮ Asymptotic analysis of the moments of the Cantor distribution ⋮ An Asymptotic Solution of Dresher’s Guessing Game ⋮ Sorting algorithms for broadcast communications: mathematical analysis.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to select a loser
• The complexity of generating an exponentially distributed variate
• Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms

This page was built for publication: Searching for losers