메뉴 건너뛰기




Volumn 55, Issue 4, 2003, Pages 885-900

One-sided variations on binary search trees

Author keywords

Contraction; Degenerate limit; Limit distribution; Random tree; Recurrence equation

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BINARY SEQUENCES; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING;

EID: 0242536504     PISSN: 00203157     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02523399     Document Type: Article
Times cited : (5)

References (22)
  • 1
    • 0002734908 scopus 로고
    • Randomized binary search technique
    • Arora, S. and Dent, W. (1969). Randomized binary search technique, Communications of the ACM, 12, 77-80.
    • (1969) Communications of the ACM , vol.12 , pp. 77-80
    • Arora, S.1    Dent, W.2
  • 3
    • 0024096601 scopus 로고
    • Applications of the theory of records in the study of random trees
    • Devroye, L. (1988). Applications of the theory of records in the study of random trees, Acta Inform., 26, 123-130.
    • (1988) Acta Inform. , vol.26 , pp. 123-130
    • Devroye, L.1
  • 5
    • 0030364144 scopus 로고    scopus 로고
    • On the distribution for the duration of a randomized leader election algorithm
    • J., Mahmoud, H. and Szpankowski, W. (1996). On the distribution for the duration of a randomized leader election algorithm, Ann. Appl. Probab., 6, 1260-1283.
    • (1996) Ann. Appl. Probab. , vol.6 , pp. 1260-1283
    • Fill, J.1    Mahmoud, H.2    Szpankowski, W.3
  • 6
    • 0242676835 scopus 로고    scopus 로고
    • One-sided variations on interval trees
    • Itoh, Y. and Mahmoud, H. (2003). One-sided variations on interval trees, J. Appl. Probab., 40, 1-17.
    • (2003) J. Appl. Probab. , vol.40 , pp. 1-17
    • Itoh, Y.1    Mahmoud, H.2
  • 11
    • 0037274512 scopus 로고    scopus 로고
    • Distribution of distances in random binary search trees
    • Mahmoud, H. and Neininger, R. (2003). Distribution of distances in random binary search trees, Ann. Appl. Probab., 13, 253-276.
    • (2003) Ann. Appl. Probab. , vol.13 , pp. 253-276
    • Mahmoud, H.1    Neininger, R.2
  • 13
    • 84974336694 scopus 로고
    • Cutting down random trees
    • Meir, A. and Moon, J. (1970). Cutting down random trees, J. Austral. Math. Soc., 11, 313-324.
    • (1970) J. Austral. Math. Soc. , vol.11 , pp. 313-324
    • Meir, A.1    Moon, J.2
  • 14
    • 0035539864 scopus 로고    scopus 로고
    • On a multivariate contraction method for random recursive structures with applications to Quicksort
    • Neininger, R. (2002). On a multivariate contraction method for random recursive structures with applications to Quicksort, Random Structures Algorithms, 19, 498-524.
    • (2002) Random Structures Algorithms , vol.19 , pp. 498-524
    • Neininger, R.1
  • 16
    • 0000789371 scopus 로고
    • How to select a loser
    • Prodinger, H. (1993). How to select a loser, Discrete Math., 120, 149-159.
    • (1993) Discrete Math. , vol.120 , pp. 149-159
    • Prodinger, H.1
  • 17
    • 0001131997 scopus 로고
    • Probability metrics and recursive algorithms
    • Rachev, S. and Rüschendorf, L. (1995). Probability metrics and recursive algorithms. Adv. in Appl. Probab., 27, 770-799.
    • (1995) Adv. in Appl. Probab. , vol.27 , pp. 770-799
    • Rachev, S.1    Rüschendorf, L.2
  • 18
    • 0002731988 scopus 로고
    • A limit theorem for "Quicksort"
    • Rösler, U. (1991). A limit theorem for "Quicksort", RAIRO Inform. Théor. Appl., 25, 85-100.
    • (1991) RAIRO Inform. Théor. Appl. , vol.25 , pp. 85-100
    • Rösler, U.1
  • 19
    • 9644259154 scopus 로고    scopus 로고
    • On the analysis of stochastic divide and conquer algorithms
    • Rösler, U. (2001). On the analysis of stochastic divide and conquer algorithms, Algorithmica, 29, 238-261.
    • (2001) Algorithmica , vol.29 , pp. 238-261
    • Rösler, U.1
  • 20
    • 0002015483 scopus 로고    scopus 로고
    • The contraction method for recursive algorithms
    • Rösler, U. and Rüschendorf, L. (2001). The contraction method for recursive algorithms, Algorithmica, 29, 3-33.
    • (2001) Algorithmica , vol.29 , pp. 3-33
    • Rösler, U.1    Rüschendorf, L.2
  • 21
    • 51249170773 scopus 로고
    • Random sequential bisection and its associated binary tree
    • Sibuya, M. and Itoh, Y. (1987). Random sequential bisection and its associated binary tree, Ann. Inst. Statist. Math., 39, 69-84.
    • (1987) Ann. Inst. Statist. Math. , vol.39 , pp. 69-84
    • Sibuya, M.1    Itoh, Y.2
  • 22
    • 0010766211 scopus 로고
    • Approximation of the distributions of sums of independent random variables with values in infinite-dimensional spaces
    • Zolotarev, V. M. (1976). Approximation of the distributions of sums of independent random variables with values in infinite-dimensional spaces, Theory Probab. Appl., 21, 721-737.
    • (1976) Theory Probab. Appl. , vol.21 , pp. 721-737
    • Zolotarev, V.M.1


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