C. Ponder, Unsolved Problems (R. Guy ed.), Amer. Math. Monthly 93 (1986), 280-281. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Analytic Approach To The Height Of Binary Search Trees II - Drmota (2000) (3 citations) (Correct)
....of VHn and VH 0 n (and of all centralized moments. 3 However, we can combine this theorem with Reed s result (2) to obtain tight asymptotics for y h (1) e h=c 3 2(c 1) log h O(1) Interestingly the asymptotic behaviour of y h (1) was posed as an unsolved problem by C. Ponder [12] without stating any connection to binary search trees. The paper is organized in the following way. Section 3 is devoted to the proof of Theorem 1, section 4 to the proof of Theorem 2 and section 5 to the proof of Theorem 3. All three proofs have a similar structure. However, they get more and ....
C. Ponder, Unsolved Problems (R. Guy ed.), Amer. Math. Monthly 93 (1986), 280-281.
Stochastic Analysis Of Tree-Like Data Structures - Drmota (2002) (Correct)
No context found.
C. Ponder, Unsolved Problems (R. Guy ed.), Amer. Math. Monthly 93 (1986), 280-281.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC