[1[ Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2020). Introduction to Algorithms. MIT Press.
[2] Kleinberg, J., & Tardos, É. (2020). Algorithm Design. Pearson.
[3] Sedgewick, R., & Wayne, K. (2021). Algorithms. Addison-Wesley.
[4] Wilf, H. S. (2022). Generating functionology. A K Peters/CRC Press.
[5] Liu, C. L. (2020). Elements of Discrete Mathematics. McGraw-Hill.
[6] Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2020). Introduction to Algorithms. MIT Press.
[7] P. R. Halmos, Naive Set Theory. Springer, 2022.
[8] D. P. Kennesaw, A Comprehensive Introduction to Recursion. Springer, 2021.
[9] T. M. Mitchell, Machine Learning. McGraw-Hill, 2022.
[10] J. A. Anderson, Discrete Mathematics for Computer Scientists. CRC Press, 2022.
[11] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Springer, 2023.
[12] C. M. P. F. B. K. T., Advanced Discrete Mathematics. Wiley, 2022.
[13] Prof. I. Ketut Budayasa, Ph.D. Matematika Diskrit. Surabaya: University Press.
[14] Rinaldi Munir. Matematika Diskrit. Bandung: Informatika.