The height of q-binary search trees.
Drmota, Michael ; Prodinger, Helmut
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 5 (2002), p. 97-108 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Access to full text
Publié le : 2002-01-01
EUDML-ID : urn:eudml:doc:122062 
@article{01741002,
     title = {The height of },
     journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
     volume = {5},
     year = {2002},
     pages = {97-108},
     zbl = {0994.68053},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01741002}
}

Drmota, Michael; Prodinger, Helmut. The height of . Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 5 (2002) pp. 97-108. http://gdmltest.u-ga.fr/item/01741002/