[[1] K.A. Berman, J. L. Paul, Fundamentals of Sequential Algorithms, PWS Publishing, 1996. ⇒146]Search in Google Scholar
[[2] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms (3rd edition), The MIT Press, 2009. ⇒148]Search in Google Scholar
[[3] T. Gregorics, Programozáas 1.kötet Tervezées, ELTE, Eötvös Kiadó, 2013. (in Hungarian) ⇒145, 153, 155, 158]Search in Google Scholar
[[4] T. Gregorics, Programming theorems on enumerator, Teaching Mathematics and Computer Science, 8, 1 (2010) 89-108. ⇒145, 153, 155, 15810.5485/TMCS.2010.0243]Search in Google Scholar
[[5] I. Fekete, T. Gregorics, S. Nagy, Bevezetés a mesterséges intelligenciába, LSI, 1990. (in Hungarian) ⇒145]Search in Google Scholar
[[6] Á. Fóthi, Bevezetés a programozásba, ELTE, Eötvös Kiadó, 2005. (in Hungarian) ⇒146, 151]Search in Google Scholar
[[7] I. Futó (ed), Mesterséges intelligencia, Aula, 1999. (in Hungarian) ⇒145]Search in Google Scholar
[[8] D. E. Knuth, Estimating the efficiency of backtrack programs, Mathematics of Computation 29 (1975) 121-136. ⇒14610.2307/2005469]Search in Google Scholar
[[9] K. I. Lörentey, Fekete, Á. Fóthi, T. Gregorics, On the wide variety of backtracking algorithms, ICAI'05 Eger, Hungary, January 28-February 3. 2005, pp. 165-174. ⇒145, 146, 151]Search in Google Scholar
[[10] N. J. Nilsson, Principles of Artificial Intelligence, Springer-Verlag, Berlin, 1982. ⇒145, 14810.1007/978-3-662-09438-9]Search in Google Scholar
