메뉴 건너뛰기
Journal of Applied Probability
Volumn 35, Issue 1, 1998, Pages 36-45
Hoare's selection algorithm: A Markov chain approach
Author keywords

Convergence in distribution; Markov chains; Randomized algorithms; Stochastic ordering
Indexed keywords

EID: 0040083333     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200014650     Document Type: Article
Times cited : (16)
References (5)
  • 1
    • 0040923508 scopus 로고
    • Exponential bounds for the running time of a selection algorithm
    • DEVROYE, L. (1984). Exponential bounds for the running time of a selection algorithm. J. Comput. System Sci. 29, 1-7.
    • (1984) J. Comput. System Sci. , vol.29 , pp. 1-7
    • Devroye, L.1
  • 2
    • 0000109458 scopus 로고    scopus 로고
    • Perpetuities with thin tails
    • GOLDIE, C. M. AND GRÜBEL, R. (1996) Perpetuities with thin tails. Adv. Appl. Prob. 28, 463-480.
    • (1996) Adv. Appl. Prob. , vol.28 , pp. 463-480
    • Goldie, C.M.1    Grübel, R.2
  • 3
    • 0000267981 scopus 로고    scopus 로고
    • Asymptotic distribution theory for Hoare's selection algorithm
    • GRÜBEL, R. AND RÖSLER, U. (1996). Asymptotic distribution theory for Hoare's selection algorithm. Adv. Appl. Prob. 28, 252-269.
    • (1996) Adv. Appl. Prob. , vol.28 , pp. 252-269
    • Grübel, R.1    Rösler, U.2
  • 4
    • 0348164422 scopus 로고
    • Algorithm 65, FIND
    • HOARE, C. A. R. (1961). Algorithm 65, FIND. Commun. ACM 4, 321-322.
    • (1961) Commun. ACM , vol.4 , pp. 321-322
    • Hoare, C.A.R.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.