1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)
2. Alexandrescu, A.: The D Programming Language. Addison-Wesley, Boston (2010)
3. Angluin, D., Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Syst. Sci. 18(2), 155–193 (1979).
https://doi.org/10.1016/0022-0000(79)90045-X
4. Baumann, T., Hagerup, T.: Rank-select indices without tears. In: Proceedings of the Algorithms and Data Structures Symposium (WADS 2019). LNCS. Springer, Cham (2019, to appear)
5. Clark, D.: Compact pat trees. Ph.D. thesis, University of Waterloo (1996)