Complexity of Layered Binary Search Trees with Relaxed Balance

Lars Jacobsen, Kim S. Larsen. Complexity of Layered Binary Search Trees with Relaxed Balance. In Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi, editors, Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings. Volume 2202 of Lecture Notes in Computer Science, pages 269-284, Springer, 2001. [doi]

Abstract

Abstract is missing.