1. Alnafie, M., Chikalov, I., Hussain, S., Moshkov, M.: Sequential optimization of binary search trees for multiple cost functions. In: Potanin, A., Viglas, T. (eds.) Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 17–20, 2011, CRPIT, vol. 119, pp. 41–44. Australian Computer Society (2011)
2. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company (2001)
3. Dutton, R.D., Brigham, R.C.: Computationally efficient bounds for the Catalan numbers. Eur. J. Comb. 7(3), 211–213 (1986)
4. Knuth, D.E.: Optimum binary search trees. Acta Inform. 1(1), 14–25 (1971)
5. Mankowski, M., Moshkov, M.: Dynamic programming bi-criteria combinatorial optimization. Discret. Appl. Math. 284, 513–533 (2020)