Binary Search Trees: How Low Can You Go?

Rolf Fagerberg. Binary Search Trees: How Low Can You Go?. In Rolf G. Karlsson, Andrzej Lingas, editors, Algorithm Theory - SWAT 96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings. Volume 1097 of Lecture Notes in Computer Science, pages 428-439, Springer, 1996.

Abstract

Abstract is missing.