Thomas M. Fischer. On the Weighted Path Length of Binary Search Trees for Unknown Access Probabilities. In Jirí Becvár, editor, Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979. Volume 74 of Lecture Notes in Computer Science, pages 284-291, Springer, 1979.
Abstract is missing.