A q-analogue of the path length in binary search trees

This item was put here on October 12, 1999. I want to submit this paper to the special issue of Algorithmica but I am going to wait a few days. I had the idea to do this in a train from Graz to Wr. Neustadt. I was totally exhausted and the reason for that trip was ridiculous, regarding that that very evening I was starting from Graz via Zuerich to Johannesburg. Also, a mother with 3 girls joined me in the compartment, not exactly adding much to my pleasure.


helmut@gauss.cam.wits.ac.za,

This paper is available in the Tex, Dvi, and PostScript format.

helmut@gauss.cam.wits.ac.za,
(Back to List of Papers)