Analysis of quickselect : an algorithm for order statistics
Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Mireille Régnier (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Patrick Bellot, Djamil Sarni (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Ştefan V. Ştefănescu (1989)
Kybernetika
Similarity:
Rudolf Grübel, Anke Reimers (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based on generating functions. Here we take a more probabilistic view which leads to a limit theorem for the distribution of the random number of steps required by the algorithm and also helps to explain the limiting logarithmic periodicity as a simple discretization phenomenon. ...
František Straka, Josef Štěpán (1993)
Mathematica Slovaca
Similarity: