The following publications are possibly variants of this publication:
- Minimal-Cost Brother TreesThomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood. SICOMP, 13(1):197-217, 1984.
- The Node Visit Cost of Brother TreesRolf Klein, Derick Wood. criwg 1987: 106-117
- The Node Visit Cost of Brother TreesRolf Klein, Derick Wood. iandc, 75(2):107-129, November 1987.
- 1-2 Brother Trees or AVL Trees RevisitedThomas Ottmann, Derick Wood. cj, 23(3):248-255, 1980.
- Balance in AVL Trees and Space Cost of Brother TreesHelen Cameron, Derick Wood. TCS, 127(2):199-228, 1994.
- On the correspondence between AVL trees and brother treesThomas Ottmann, Hans-Werner Six, Derick Wood. computing, 23(1):43-54, 1979. [doi]
- Node-Visit Optimal 1-2 Brother TreesThomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood. tcs 1979: 213-221
- Higher Order Analysis of Random 1-2 Brother TreesThomas Ottmann, Wolffried Stucky. bit, 20(3):302-314, 1980.
- The implementation of insertion and deletion algorithms for 1-2 brother treesThomas Ottmann, Hans-Werner Six, Derick Wood. computing, 26(4):367-378, 1981. [doi]