Gonnet G.
(1983). Balancing binary trees by internal path reduction. Communications of the ACM. 26:12. (1074-1081). Online publication date: 1-Dec-1983.
Bongiovanni G and Wong C.
(1981). Tree Search in Major/Minor Loop Magnetic Bubble Memories. IEEE Transactions on Computers. 30:8. (537-545). Online publication date: 1-Aug-1981.
Gudes E and Ganesh S.
(1981). A Survey of File Organizations and Performance. Advances in Information Systems Science. 10.1007/978-1-4613-9883-7_1. (1-73).
Ottmann T, Six H and Wood D.
(1979). One-sided k-height-balanced treesEinseitigk-höhenbalanzierte Bäume. Computing. 10.1007/BF02265310. 22:4. (283-290). Online publication date: 1-Dec-1979.
Räihä K and Zweben S.
(1979). An optimal insertion algorithm for one-sided height-balanced binary search trees. Communications of the ACM. 22:9. (508-512). Online publication date: 1-Sep-1979.