| Article ID: | iaor20121063 |
| Volume: | 31 |
| Issue: | 3 |
| Start Page Number: | 433 |
| End Page Number: | 441 |
| Publication Date: | Nov 2001 |
| Journal: | Algorithmica |
| Authors: | Prodinger H |
| Keywords: | optimization, networks: path |
A reformulation of the path length of binary search trees is given in terms of permutations, allowing us to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with parameter