The following publications are possibly variants of this publication:
- AVL Trees with Relaxed BalanceKim S. Larsen. ipps 1994: 888-893
- B-trees with relaxed balanceKim S. Larsen, Rolf Fagerberg. ipps 1995: 196-202 [doi]
- Variants of (A, B)-Trees with Relaxed BalanceLars Jacobsen, Kim S. Larsen. ijfcs, 12(4):455-478, 2001.
- Efficient Rebalancing of B-Trees with Relaxed BalanceKim S. Larsen, Rolf Fagerberg. ijfcs, 7(2):169, 1996.
- Relaxed balance for search trees with local rebalancingKim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen. ACTA, 37(10):743-763, 2001. [doi]
- Search Trees with Relaxed Balance and Near-Optimal HeightRolf Fagerberg, Rune E. Jensen, Kim S. Larsen. wads 2001: 414-425 [doi]
- Relaxed Balance for Search Trees with Local RebalancingKim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen. esa 1997: 350-363
- Complexity of Layered Binary Search Trees with Relaxed BalanceLars Jacobsen, Kim S. Larsen. ictcs 2001: 269-284 [doi]