Volume 3, Issue 2 (November 2004)                   JIRSS 2004, 3(2): 271-296 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

R¨osler U. QUICKSELECT Revisited. JIRSS. 2004; 3 (2) :271-296
URL: http://jirss.irstat.ir/article-1-113-en.html
Abstract:   (5573 Views)
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
Full-Text [PDF 225 kb]   (1710 Downloads)    
Subject: 60: Probability theory and stochastic processes
Received: 2011/08/26 | Accepted: 2015/09/12

Add your comments about this article : Your username or Email:
Write the security code in the box

© 2015 All Rights Reserved | Journal of The Iranian Statistical Society