- Mikhail Budrevich, Gregor Dolinar, Alexander Guterman, Bojan Kuzma, “Lower bounds for Pólya’s problem on permanent”, Int. J. Algebra Comput., 26, № 06, 2016, 1237
- V. M. Fomichev, S. N. Kyazhin, “Local primitivity of matrices and graphs”, J. Appl. Ind. Math., 11, № 1, 2017, 26
- Krasimir Yordzhev, “Calculating the cardinality of some classes of binary matrices using bitwise operations — A polynomial algorithm”, Discrete Math. Algorithm. Appl., 11, № 03, 2019, 1950038
- Yu. A. Alpin, A. E. Guterman, E. R. Shafeev, “An Upper Bound for the Chainable Index”, J Math Sci, 272, № 4, 2023, 487
- Sonica Anand, Amit Roy, “Graded Betti numbers of some families of circulant graphs”, Rocky Mountain J. Math., 51, № 6, 2021
- Fedor Mikhailovich Malyshev, “$k$-Конфигурации”, Труды Математического института имени В. А. Стеклова, 316, 2022, 248
- D. A. Kuropatkin, “A probabilistic algorithm for finding the term rank of non-negative matrices”, Discrete Mathematics and Applications, 15, № 2, 2005, 171
- Abdul Salam Jarrah, Reinhard Laubenbacher, Alan Veliz-Cuba, “The Dynamics of Conjunctive and Disjunctive Boolean Network Models”, Bull. Math. Biol., 72, № 6, 2010, 1425
- Vladimir Fomichev, Alisa Koreneva, “Encryption performance and security of certain wide block ciphers”, J Comput Virol Hack Tech, 16, № 3, 2020, 197
- E. Y. Lerner, “Complexity of prime-dimensional sequences over a finite field”, Funct. Anal. Other Math., 2, № 2-4, 2009, 251