SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Algorithms

Volumn 21, Issue 3, 1996, Pages 476-507

Large Deviations for Quicksort

(2) McDiarmid, C J H a Hayward, R B b

a UNIVERSITY OF OXFORD (United Kingdom)

b UNIVERSITY OF LETHBRIDGE (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001258015 PISSN: 01966774 EISSN: None Source Type: Journal
DOI: 10.1006/jagm.1996.0055 Document Type: Article

Times cited : (32)

References (14)

1
- 0022754664
- A note on the height of binary search trees
- L. Devroye, A note on the height of binary search trees, J. Assoc. Comput. Mach. 33(3) (1986), 489-498.
- (1986) J. Assoc. Comput. Mach. , vol.33 , Issue.3 , pp. 489-498
- Devroye, L.¹

2
- 0000975791
- Combinatorial analysis of quicksort algorithm
- P. Hennequin, Combinatorial analysis of quicksort algorithm, Theoret. Inform. Appl. 23(3) (1989), 317-333.
- (1989) Theoret. Inform. Appl. , vol.23 , Issue.3 , pp. 317-333
- Hennequin, P.¹

3
- 0348164422
- Partition (algorithm 63), quicksort (algorithm 64), and find (algorithm 65)
- C. A. R. Hoare, Partition (algorithm 63), quicksort (algorithm 64), and find (algorithm 65), J. Assoc. Comput. Mach. 7 (1961), 321-322.
- (1961) J. Assoc. Comput. Mach. , vol.7 , pp. 321-322
- Hoare, C.A.R.¹

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

5
- 0003657590
- Addison-Wesley, Reading, MA
- D. Knuth, "The Art of Computer Programming," first ed., Addison-Wesley, Reading, MA, 1973.
- (1973) "The Art of Computer Programming," First Ed.
- Knuth, D.¹

6
- 0003591451
- Wiley, New York
- H. M. Mahmoud, "Evolution of Random Search Trees," Wiley, New York, 1992.
- (1992) Evolution of Random Search Trees
- Mahmoud, H.M.¹

7
- 0001035413
- On the method of bounded differences
- (J. Siemons, ed.), London Math Society, London
- C. J. H. McDiarmid, On the method of bounded differences, in "Surveys in Combinatorics," (J. Siemons, ed.), London Math Society, London, 1989.
- (1989) Surveys in Combinatorics
- McDiarmid, C.J.H.¹

8
- 6344227807
- Strong concentration for quicksort
- C. J. H. McDiarmid and R. B. Hayward, Strong concentration for quicksort, in "Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, FL, Jan. 1992," pp. 414-421.
- Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, FL, Jan. 1992 , pp. 414-421
- McDiarmid, C.J.H.¹ Hayward, R.B.²

9
- 0004239351
- North-Holland/Am. Elsevier, Amsterdam/New York
- J. Neveu, "Discrete-Parameter Martingales," North-Holland/Am. Elsevier, Amsterdam/New York, 1975.
- (1975) Discrete-Parameter Martingales
- Neveu, J.¹

10
- 0002497513
- A limiting distribution for quicksort
- M. Régnier, A limiting distribution for quicksort, Theoret. Inform. Appl. 23(3) (1989), 335-343.
- (1989) Theoret. Inform. Appl. , vol.23 , Issue.3 , pp. 335-343
- Régnier, M.¹

11
- 0002731988
- A limit theorem for quicksort
- U. Rösler, A limit theorem for quicksort, Theoret. Inform. Appl. 25(1) (1991), 85-100.
- (1991) Theoret. Inform. Appl. , vol.25 , Issue.1 , pp. 85-100
- Rösler, U.¹

12
- 0004244040
- Garland, New York
- R. Sedgewick, "Quicksort," first ed., Garland, New York, 1980.
- (1980) "Quicksort," First Ed.
- Sedgewick, R.¹

13
- 0014849316
- Increasing the efficiency of quicksort
- M. H. VanEmden, Increasing the efficiency of quicksort, Comm. ACM 13(9) (1970), 563-567.
- (1970) Comm. ACM , vol.13 , Issue.9 , pp. 563-567
- VanEmden, M.H.¹

14
- 0004228766
- Cambridge Univ. Press, Cambridge, UK
- D. Williams, "Probability with Martingales," Cambridge Univ. Press, Cambridge, UK, 1991.
- (1991) Probability with Martingales
- Williams, D.¹

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