Analysis of the Expected Search Cost in Skip Lists

Skip lists, introduced by W. Pugh, provide an alternative to search trees. The exact value of the expected search cost is derived (in terms of previously studied functions), as well as an asymptotic expression for it. The latter suggests that Pugh's upper bound is fairly tight for the interesting cases.