1. AbouEisha, H., Gurgul, P., Paszynska, A., Paszynski, M., Kuznik, K., Moshkov, M.: An automatic way of finding robust elimination trees for a multi-frontal sparse solver for radical 2D hierarchical meshes. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) Parallel Processing and Applied Mathematics – 10th International Conference, PPAM 2013, Warsaw, Poland, September 8–11, 2013, Revised Selected Papers, Part II. Lecture Notes in Computer Science, vol. 8385, pp. 531–540. Springer, Berlin (2013)
2. AbuBekr, J., Chikalov, I., Hussain, S., Moshkov, M.: Sequential optimization of paths in directed graphs relative to different cost functions. In: Sato, M., Matsuoka, S., Sloot, P.M.A., van Albada, G.D., Dongarra, J. (eds.) International Conference on Computational Science, ICCS 2011, Nanyang Technological University, Singapore, June 1–3, 2011. Procedia Computer Science, vol. 4, pp. 1272–1277. Elsevier (2011)
3. 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 2011. CRPIT, vol. 119, pp. 41–44. Australian Computer Society (2011)
4. Bayes, A.J.: A dynamic programming algorithm to optimise decision table code. Aust. Comput. J. 5(2), 77–79 (1973)
5. Bellman, R.: The theory of dynamic programming. Bull. Am. Math. Soc. 60(6), 503–516 (1954)