A probabilistic analysis of some tree algorithms

被引：10
|
作者：
Mohamed, H [1 ]
Robert, P [1 ]
机构：
[1] INRIA, F-78153 Le Chesnay, France
来源：
ANNALS OF APPLIED PROBABILITY | 2005年 / 15卷 / 04期
关键词：
splitting algorithms; divide and conquer algorithms; unusual laws of large numbers; asymptotic oscillating behavior; data structures; tries; renewal theorem;
D O I：
10.1214/105051605000000494
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques. This approach gives a unified probabilistic treatment of these questions. It simplifies and extends some of the results known in this domain.
引用
收藏
页码：2445 / 2471
页数：27
相关论文
共 50 条
  • [31] Probabilistic analysis of shelf algorithms for strip packing
    Discrete Math Appl, 2006, 1 (61-72):
  • [32] PROBABILISTIC ANALYSIS AND ALGORITHMS FOR RECONFIGURATION OF MEMORY ARRAYS
    SHI, WP
    FUCHS, WK
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1992, 11 (09) : 1153 - 1160
  • [33] Asymptotically optimal probabilistic embedding algorithms for supporting tree structured computations in hypercubes
    Li, KQ
    Dorband, JE
    FRONTIERS '99 - THE SEVENTH SYMPOSIUM ON THE FRONTIERS OF MASSIVELY PARALLEL COMPUTATION, PROCEEDINGS, 1999, : 218 - 225
  • [34] PROBABILISTIC ALGORITHMS
    SCHONING, U
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 211 : 30 - 41
  • [35] ON SOME PROBABILISTIC ASPECTS OF CLASSICAL ANALYSIS
    KAC, M
    AMERICAN MATHEMATICAL MONTHLY, 1970, 77 (06): : 586 - &
  • [36] Some improvements in tree based nearest neighbour search algorithms
    Gómez-Ballester, E
    Micó, L
    Oncina, J
    PROGRESS IN PATTERN RECOGNITION, SPEECH AND IMAGE ANALYSIS, 2003, 2905 : 456 - 463
  • [37] Approximation algorithms for some optimum communication spanning tree problems
    Wu, BY
    Chao, KM
    Tang, CY
    DISCRETE APPLIED MATHEMATICS, 2000, 102 (03) : 245 - 266
  • [38] Approximation algorithms for some optimum communication spanning tree problems
    Wu, BY
    Chao, KM
    Tang, CY
    ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 407 - 416
  • [39] SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE
    Soman, Jyothish
    Kothapalli, Kishore
    Narayanan, P. J.
    PARALLEL PROCESSING LETTERS, 2010, 20 (04) : 325 - 339
  • [40] Probabilistic fault tree analysis of a radiation treatment system
    Ekaette, Edidiong
    Lee, Robert C.
    Cooke, David L.
    Iftody, Sandra
    Craighead, Peter
    RISK ANALYSIS, 2007, 27 (06) : 1395 - 1410
12345