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.
@inproceedings{Fleischer93, title = {A Simple Balanced Search Tree with O(1) Worst-Case Update Time}, author = {Rudolf Fleischer}, year = {1993}, tags = {search}, researchr = {https://researchr.org/publication/Fleischer93}, cites = {0}, citedby = {0}, pages = {138-146}, booktitle = {Algorithms and Computation, 4th International Symposium, ISAAC 93, Hong Kong, December 15-17, 1993, Proceedings}, editor = {Kam-Wing Ng and Prabhakar Raghavan and N. V. Balasubramanian and Francis Y. L. Chin}, volume = {762}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-57568-5}, }