Brodal, G. S. (2025). Bottom-up rebalancing binary search trees by flipping a coin. Theoretical computer science, 1055, 115543. https://doi.org/10.1016/j.tcs.2025.115543
Chicago-Zitierstil (17. Ausg.)Brodal, Gerth Stølting. "Bottom-up Rebalancing Binary Search Trees by Flipping a Coin." Theoretical Computer Science 1055 (2025): 115543. https://doi.org/10.1016/j.tcs.2025.115543.
MLA-Zitierstil (9. Ausg.)Brodal, Gerth Stølting. "Bottom-up Rebalancing Binary Search Trees by Flipping a Coin." Theoretical Computer Science, vol. 1055, 2025, p. 115543, https://doi.org/10.1016/j.tcs.2025.115543.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.