Author： Chen W.Y.C.
Publisher： Elsevier
ISSN： 0195-6698
Source： European Journal of Combinatorics, Vol.19, Iss.5, 1998-07, pp. : 553-558
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Digital search trees and chaos game representation
By Cénac Peggy Chauvin Brigitte Ginouillac Stéphane Pouyanne Nicolas
ESAIM: Probability and Statistics, Vol. 13, Iss. issue, 2009-02 ,pp. :
Access to resources
Recommend
Bulletin of the Australian Mathematical Society, Vol. 48, Iss. 1, 1993-08 ,pp. :
Why minimax is not that pessimistic
ESAIM: Probability and Statistics, Vol. 17, Iss. issue, 2013-06 ,pp. :
Branching random walks on binary search trees: convergence of the occupation measure
By Fekete Eric
ESAIM: Probability and Statistics, Vol. 14, Iss. issue, 2010-10 ,pp. :
The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. :