@techreport{Adams92,author={Stephen Adams},
title={Implementing Sets Efficiently in a Functional Language},
institution={Department of Electronics and Computer Science, University of Southampton},
number={CSTR 92-10},year=1992}

@article{Adams93,author={Stephen Adams},
title={Efficient Sets - {A} Balancing Act},
journal={Journal of Functional Programming},volume=3,number=4,pages={553--561},
year=1993}

@article{BlumM80,author={Norbert Blum and Kurt Mehlhorn},
title={On the Average Number of Rebalancing Operations in Weight-Balanced Trees},
  journal   = {Theoretical Compututer Science},
  volume    = {11},
  pages     = {303--320},
  year      = {1980}
}

@article{HiraiY11,
author={Yoichi Hirai and Kazuhiko Yamamoto},
title={Balancing weight-balanced trees},
journal={Journal of Functional Programming},
volume=21,number=3,pages={287-307},year=2011}

@inproceedings{NievergeltR72,
 author = {Nievergelt, J. and Reingold, E. M.},
 title = {Binary Search Trees of Bounded Balance},
 booktitle = {Proc.\ 4th ACM Symposium on Theory of Computing},
 series = {STOC '72},
 year = {1972},
 pages = {137--142},
 url = {http://doi.acm.org/10.1145/800152.804906},
 doi = {10.1145/800152.804906},
 publisher = {ACM},
}

@article{NievergeltR73,
author = {J. Nievergelt and E. M. Reingold},
title = {Binary Search Trees of Bounded Balance},
journal = {SIAM Journal on Computing},
volume = {2},
number = {1},
pages = {33-43},
year = {1973},
doi = {10.1137/0202005},
URL = {https://doi.org/10.1137/0202005},
}

@inproceedings{Roura01,author = {S. Roura},
title = {A new method for balancing binary search trees},
booktitle = {Automata, Languages and Programming, ICALP 2001},
editor={Orejas, F. and Spirakis, P. and van Leeuwen, J.},
series={LNCS},volume=2076,year=2001,pages={469-480},publisher={Springer},
}

@inproceedings{Straka12,author = {Milan Straka},
title = {Adams' Trees Revisited. {C}orrect and Efficient Implementation},
booktitle = {Trends in Functional Programming},
series={LNCS},volume=7193,year=2011,pages={130--145},publisher={Springer},
}
