SCOPUS 정보 검색 플랫폼

Random Structures and Algorithms

Volumn 13, Issue 3-4, 1998, Pages 189-209

A generating functions approach for the analysis of grand averages for multiple QUICKSELECT

(2) Panholzer, Alois a Prodinger, Helmut a

a VIENNA UNIVERSITY OF TECHNOLOGY (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032193908 PISSN: 10429832 EISSN: None Source Type: Journal
DOI: 10.1002/(sici)1098-2418(199810/12)13:3/4<189::aid-rsa1>3.0.co;2-r Document Type: Article

Times cited : (20)

References (16)

1
- 0004172239
- Birkhauser, Boston
- D. H. Greene and D. E. Knuth, Mathematics for the Analysis of Algorithms, 2nd ed., Birkhauser, Boston, 1982.
- (1982) Mathematics for the Analysis of Algorithms, 2nd Ed.
- Greene, D.H.¹ Knuth, D.E.²

2
- 0000975791
- Combinatorial analysis of quicksort algorithm
- P. Hennequin, Combinatorial analysis of quicksort algorithm, RAIRO Inform. Théor. Appl., 23, 317-333 (1989).
- (1989) RAIRO Inform. Théor. Appl. , vol.23 , pp. 317-333
- Hennequin, P.¹

3
- 0348164422
- Find (Algorithm 65)
- C. A. R. Hoare, Find (Algorithm 65), Comm. ACM, 4, 321-322 (1961).
- (1961) Comm. ACM , vol.4 , pp. 321-322
- Hoare, C.A.R.¹

4
- 0002217386
- Quicksort
- C. A. R. Hoare, Quicksort. Computer J., 5, 10-15 (1962).
- (1962) Computer J. , vol.5 , pp. 10-15
- Hoare, C.A.R.¹

5
- 0003977467
- Ph.D. thesis, Ecole Polytechnique
- H.-K. Hwang, Théorèmes limites pour les structures combinatoires et les fonctions arithmétiques, Ph.D. thesis, Ecole Polytechnique, 1994.
- (1994) Théorèmes Limites Pour les Structures Combinatoires et les Fonctions Arithmétiques
- Hwang, H.-K.¹

6
- 0031540315
- Analysis of Hoare's find algorithm with median-of-three partition
- P. Kirschenhofer, C. Martínez, and H. Prodinger, Analysis of Hoare's Find algorithm with median-of-three partition, Random Struct. Alg., 10, 143-156 (1997).
- (1997) Random Struct. Alg. , vol.10 , pp. 143-156
- Kirschenhofer, P.¹ Martínez, C.² Prodinger, H.³

7
- 0032358895
- Comparisons in Hoare's find algorithm
- P. Kirschenhofer and H. Prodinger, Comparisons in Hoare's Find algorithm, Combin. Probab. Comput., 7, 111-120 (1998).
- (1998) Combin. Probab. Comput. , vol.7 , pp. 111-120
- Kirschenhofer, P.¹ Prodinger, H.²

8
- 0003657590
- Addison-Wesley, Reading, MA
- D. E. Knuth, The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973.
- (1973) The Art of Computer Programming , vol.3
- Knuth, D.E.¹

9
- 0030210371
- Average-case analysis of multiple quickselect: An algorithm for finding order statistics
- J. Lent and H. M. Mahmoud, Average-case analysis of multiple quickselect: An algorithm for finding order statistics, Statist. Probab. Lett., 28, 299-310 (1996).
- (1996) Statist. Probab. Lett. , vol.28 , pp. 299-310
- Lent, J.¹ Mahmoud, H.M.²

10
- 0004022053
- American Mathematical Society, Providence, RI
- L. Lewin, Ed., Structural Properties of Polylogarithms, American Mathematical Society, Providence, RI, 1991.
- (1991) Structural Properties of Polylogarithms
- Lewin, L.¹

11
- 0000065736
- Analysis of one-sided quicksort: An algorithm for order statistics
- H. M. Mahmoud, R. M. Modarres, and R. T. Smythe, Analysis of one-sided quicksort: An algorithm for order statistics, RAIRO, Inform. Théor. Appl., 29, 255-276 (1995).
- (1995) RAIRO, Inform. Théor. Appl. , vol.29 , pp. 255-276
- Mahmoud, H.M.¹ Modarres, R.M.² Smythe, R.T.³

12
- 0013547548
- Probabilistic analysis of multiple quickselect
- to appear
- H. M. Mahmoud and R. T. Smythe, Probabilistic analysis of multiple quickselect, Algorithmica, to appear.
- Algorithmica
- Mahmoud, H.M.¹ Smythe, R.T.²

13
- 10044266639
- Descendants and ascendants in random search trees
- C. Martínez, A. Panholzer, and H. Prodinger, Descendants and ascendants in random search trees, Electron. J. Combin., 5, R20 (1998).
- (1998) Electron. J. Combin. , vol.5
- Martínez, C.¹ Panholzer, A.² Prodinger, H.³

14
- 0000890190
- Multiple quickselect - Hoare's find algorithm for several elements
- H. Prodinger, Multiple quickselect - Hoare's Find algorithm for several elements, Inform. Process. Lett., 56, 123-129 (1995).
- (1995) Inform. Process. Lett. , vol.56 , pp. 123-129
- Prodinger, H.¹

15
- 0002497513
- A limiting distribution for quicksort
- M. Régnier, A limiting distribution for quicksort, RAIRO Inform. Théor. Appl., 23, 335-343 (1989).
- (1989) RAIRO Inform. Théor. Appl. , vol.23 , pp. 335-343
- Régnier, M.¹

16
- 0002731988
- A limit theorem for quicksort
- U. Rösler, A limit theorem for quicksort, RAIRO Inform. Théor. Appl., 25, 85-100 (1991).
- (1991) RAIRO Inform. Théor. Appl. , vol.25 , pp. 85-100
- Rösler, U.¹

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