|title:||The distribution of m-ary search trees generated by van der Corput sequences|
|keywords:||m-ary search trees, van der Corput sequence, tree height, central limit theorem, generating function|
|abstract:||We study the structure of m-ary search trees generated by the van der Corput sequences. The height of the tree is calculated and a generating function approach shows that the distribution of the depths of the nodes is asymptotically normal. Additionally a local limit theorem is derived.
If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files.
|reference:||Wolfgang Steiner (2004), The distribution of m-ary search trees generated by van der Corput sequences, Discrete Mathematics and Theoretical Computer Science 6, pp. 409-424|
|bibtex:||For a corresponding BibTeX entry, please consider our BibTeX-file.|
|ps.gz-source:||dm060215.ps.gz (69 K)|
|ps-source:||dm060215.ps (190 K)|
|pdf-source:||dm060215.pdf (119 K)|
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.