A Simple Balanced Search Tree with O(1) Worst-Case Update Time

Rudolf Fleischer. A Simple Balanced Search Tree with O(1) Worst-Case Update Time. In Kam-Wing Ng, Prabhakar Raghavan, N. V. Balasubramanian, Francis Y. L. Chin, editors, Algorithms and Computation, 4th International Symposium, ISAAC 93, Hong Kong, December 15-17, 1993, Proceedings. Volume 762 of Lecture Notes in Computer Science, pages 138-146, Springer, 1993.

Abstract

Abstract is missing.