|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
A. V. Galatenko, V. A. Nosov, A. E. Pankratiev, K. D. Tsaregorodtsev, “Generation of $n$-quasigroups by proper families of functions”, Diskr. Mat., 35:1 (2023), 35–53   |
2
|
| 2. |
A. V. Galatenko, A. E. Pankratiev, K. D. Tsaregorodtsev, “A criterion of properness for a family of functions”, Fundam. Prikl. Mat., 24:4 (2023), 61–73 |
| 3. |
A. V. Galatenko, V. A. Nosov, A. E. Pankratiev, K. D. Tsaregorodtsev, “Proper families of functions and their applications”, Mat. Vopr. Kriptogr., 14:2 (2023), 43–58 |
2
|
|
2022 |
| 4. |
D. V. Alekseev, A. V. Galatenko, V. V. Galatenko, S. A. Nersisyan, V. M. Staroverov, “A mathematical model of within-host COVID-19 dynamics”, Dal'nevost. Mat. Zh., 22:2 (2022), 150–151 |
1
|
| 5. |
A. V. Galatenko, V. V. Galatenko, A. E. Pankratiev, “Strong Polynomial Completeness of Almost All Quasigroups”, Mat. Zametki, 111:1 (2022), 8–14 ; Math. Notes, 111:1 (2022), 7–12   |
|
2021 |
| 6. |
A. V. Galatenko, A. E. Pankratiev, V. M. Staroverov, “An algorithm for checking the existence of subquasigroups”, Chebyshevskii Sb., 22:2 (2021), 76–89 |
1
|
| 7. |
A. V. Galatenko, A. E. Pankratiev, V. M. Staroverov, “Efficiency of deciding existence of $n$-subqusdigroups”, Intelligent systems. Theory and applications, 25:4 (2021), 104–107 |
| 8. |
A. V. Galatenko, V. A. Nosov, A. E. Pankratiev, V. M. Staroverov, “Generation of proper families of functions”, Intelligent systems. Theory and applications, 25:4 (2021), 100–103 |
|
2020 |
| 9. |
A. V. Galatenko, V. A. Nosov, A. E. Pankratiev, “Generation of multivariate quadratic quasigroups by proper families of Boolean functions”, Fundam. Prikl. Mat., 23:2 (2020), 57–73 ; J. Math. Sci., 262:5 (2022), 630–641 |
4
|
|
2019 |
| 10. |
A. Bernadotte, A. V. Galatenko, “Structural automaton design for solving the problem of exponential blowup for one class of regular languages”, Intelligent systems. Theory and applications, 23:4 (2019), 27–38 |
1
|
| 11. |
A. V. Galatenko, A. E. Pankratiev, S. B. Rodin, “Polynomial completeness of finite quasigroups”, Intelligent systems. Theory and applications, 23:1 (2019), 81–87 |
|
2018 |
| 12. |
A. V. Galatenko, A. E. Pankratiev, S. B. Rodin, “Polynomially complete quasigroups of prime order”, Algebra Logika, 57:5 (2018), 509–521 ; Algebra and Logic, 57:5 (2018), 327–3335 |
6
|
| 13. |
A. V. Galatenko, A. E. Pankratiev, “The complexity of checking the polynomial completeness of finite quasigroups”, Diskr. Mat., 30:4 (2018), 3–11  ; Discrete Math. Appl., 30:3 (2020), 169–175 |
6
|
| 14. |
R. A. Ishchenko, A. S. Podkolzin, D. N. Zhuk, S. V. Moiseev, A. M. Mironov, K. A. Golikov, P. S. Dergach, A. V. Galatenko, I. L. Mazurenko, A. Yu. Konovalov, E. A. Kurganov, “Reports from the Automata Theory seminar”, Intelligent systems. Theory and applications, 22:4 (2018), 137–142 |
|
2016 |
| 15. |
A. V. Galatenko, A. E. Pankratiev, S. B. Rodin, “О полиномиально полных квазигруппах простого порядка”, Intelligent systems. Theory and applications, 20:3 (2016), 194–198 |
2
|
| 16. |
D. E. Alexandrov, A. V. Galatenko, “О сложности проверки существования доступа в RelBAC-политиках”, Intelligent systems. Theory and applications, 20:3 (2016), 189–193 |
|
2015 |
| 17. |
A. V. Galatenko, A. A. Nechaev, A. E. Pankrat'ev, “Comparing finite Abelian groups from the standpoint of their cryptographic applications”, Fundam. Prikl. Mat., 20:1 (2015), 9–16 ; J. Math. Sci., 223:5 (2017), 498–503 |
|
2009 |
| 18. |
A. V. Galatenko, V. V. Galatenko, “On Hamming distance between almost all Boolean functions”, Fundam. Prikl. Mat., 15:5 (2009), 43–47 ; J. Math. Sci., 172:5 (2011), 650–653 |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: