| Определимость в языке функциональных уравнений счетнозначной логики | Diskretnaya Matematika | | 2 | 2013 |
| Marchenkov, S.S., On Complexity of Solving Systems of Functional Equations in Countable-Valued Logic, Diskretn. Anal. Issled. Oper., 2015, vol. 22, no. 2, pp. 49–62. | Diskretnyi analiz i issledovanie operatsii | | | 2015 |
| Markov, Al.A., Non-recurrent Coding, Probl. Kibern., 1962, vol. 8, pp. 169–186. | | | | 1962 |
| Markov, Al.A., On Alphabet Coding, Dokl. Akad. Nauk SSSR, 1960, vol. 132, no. 3, pp. 521–523 [Soviet Math. Dokl. (Engl. Transl.), 1960, vol. 1, pp. 596-598]. | | | | 1960 |
| Vestn ik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet. | | | | 2013 |