@article{VMUMM_2024_6_a2,
author = {\`E. \`E. Gasanov and D. N. Babin and A. V. Galatenko and D. N. Zhuk and G. V. Kalachev and P. A. Panteleev and A. A. Chasovskikh},
title = {MaTIS {\textendash} the school of {V.B.} {Kudryavtsev:} traditions and advancement},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {15--26},
year = {2024},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2024_6_a2/}
}
TY - JOUR AU - È. È. Gasanov AU - D. N. Babin AU - A. V. Galatenko AU - D. N. Zhuk AU - G. V. Kalachev AU - P. A. Panteleev AU - A. A. Chasovskikh TI - MaTIS – the school of V.B. Kudryavtsev: traditions and advancement JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 2024 SP - 15 EP - 26 IS - 6 UR - http://geodesic.mathdoc.fr/item/VMUMM_2024_6_a2/ LA - ru ID - VMUMM_2024_6_a2 ER -
%0 Journal Article %A È. È. Gasanov %A D. N. Babin %A A. V. Galatenko %A D. N. Zhuk %A G. V. Kalachev %A P. A. Panteleev %A A. A. Chasovskikh %T MaTIS – the school of V.B. Kudryavtsev: traditions and advancement %J Vestnik Moskovskogo universiteta. Matematika, mehanika %D 2024 %P 15-26 %N 6 %U http://geodesic.mathdoc.fr/item/VMUMM_2024_6_a2/ %G ru %F VMUMM_2024_6_a2
È. È. Gasanov; D. N. Babin; A. V. Galatenko; D. N. Zhuk; G. V. Kalachev; P. A. Panteleev; A. A. Chasovskikh. MaTIS – the school of V.B. Kudryavtsev: traditions and advancement. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2024), pp. 15-26. http://geodesic.mathdoc.fr/item/VMUMM_2024_6_a2/
[1] Kudryavtsev V.B., “Kafedra matematicheskoi teorii intellektualnykh sistem (MaTIS)”, Intellektualnye sistemy. Teoriya i prilozheniya, 18:2 (2014), 5–30 | MR
[2] Aleshin S.V., Gasanov E.E., Kozlov V.N., “Kafedra matematicheskoi teorii intellektualnykh sistem (MaTIS)”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:4 (2021), 19–27
[3] Kazakov I.B., Matematicheskie modeli peredachi informatsii cherez zashumlennye skrytye kanaly, Kand. dis., M., 2021
[4] Chasovskikh A.A., “Zamknutye klassy lineino-avtomatnykh funktsii”, Matem. voprosy kibernetiki, 13 (2004), 113–136 | MR | Zbl
[5] Chasovskikh A.A., “Ob A-vyrazimosti v klasse lineino-avtomatnykh funktsii”, Matem. voprosy kibernetiki, 17 (2008), 105–36
[6] Chasovskikh A.A., “Lineino-avtomatnye funktsii s operatsiyami superpozitsii”, Neirokompyutery: razrabotka, primenenie, 2013, no. 8, 3–13
[7] Chasovskikh A.A., “O polnote v klasse lineinykh 2-adicheskikh avtomatov”, Intellektualnye sistemy. Teoriya i prilozheniya, 20:4 (2016), 209–227
[8] Chasovskikh A.A., “Problema polnoty dlya klassa lineino-avtomatnykh funktsii”, Diskretn. matem., 27:2 (2015), 134–151 | DOI | MR
[9] Chasovskikh A.A., “Maksimalnye podklassy v klassakh lineinykh avtomatov nad konechnymi polyami”, Diskretn. matem., 31:4 (2019), 88–101 | DOI
[10] Eichner L., Lineare Realisierbarkeit endlicher Automateen uber endlicher Korpern, Dissertation, Freiburg, 1971 | MR
[11] Herman G.T., “Every finite sequential machine is linearly realizable”, J. Comput. and System Sci., 1971, no. 5, 489–510 | DOI | MR | Zbl
[12] Ronzhin D.V., “Raspoznavanie A-polnoty konechnykh sistem lineinykh avtomatov s dobavkami nad koltsom dvoichno-ratsionalnykh chisel”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:1 (2021), 149–163
[13] Ronzhin D.V., “O konechnoi porozhdennosti A-predpolnykh klassov v klasse lineinykh avtomatov nad koltsom dvoichno-ratsionalnykh chisel”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:3 (2021), 191–202
[14] Babin D.N., Ischenko R.A., “O vosstanovlenii diagrammy avtomata po ego grafu”, Mat-ly XIV Mezhdunar. seminara “Diskretnaya matematika i ee prilozheniya” imeni akademika O. B. Lupanova (Moskva, MGU, 20–25 iyunya 2022 g.), M., 2022, 309
[15] Ischenko R.A., O svoistvakh razlozhimykh grafov, Kand. dis., M., 2022
[16] Bulatov A.A., “A dichotomy theorem for nonuniform CSPs”, IEEE 58th Annual Symp. on Foundations of Computer Science (FOCS) (Berkeley, USA), 2017, 319–330 | MR
[17] Zhuk D., “A proof of the CSP dichotomy conjecture”, J. ACM (JACM), 67:5 (2020), 1–78 | DOI | MR
[18] Barto L., Brady Z., Bulatov A., Kozik M., Zhuk D., “Unifying the three algebraic approaches to the CSP via minimal Taylor algebras”, TheoretiCS, 3 (2024) | DOI | MR
[19] Barto L., Brady Z., Bulatov A., Kozik M., Zhuk D., “Minimal Taylor algebras as a common framework for the three algebraic approaches to the CSP”, 36th Annual ACM/IEEE Symp. on Logic in Computer Science (LICS) (Rome, Italy, 2021), 1–13 | MR
[20] Zhuk D., Martin B., “QCSP monsters and the demise of the Chen Conjecture”, J. ACM (JACM), 69:5 (2022), 1–44 | DOI | MR
[21] Zhuk D., $\Pi_{2}^{P}$ vs PSpace dichotomy for the quantified constraint satisfaction problem, 2024, arXiv: 2404.03844 | MR
[22] Zhuk D., Martin B., Wrona M., “The complete classification for quantified equality constraints”, Proc. Annual ACM-SIAM Symp. on Discrete Algorithms (SODA) (Florence, Italy, 2023) | MR
[23] Zhuk D., “No-rainbow problem and the surjective constraint satisfaction problem”, 36th Annual ACM/IEEE Symp. on Logic in Computer Science (LICS) (Rome, Italy, 2021), 1–7 | MR
[24] Korchagin N.P., “Slozhnost zadachi o suschestvovanii syur'ektivnogo gomomorfizma na refleksivnye tsikly”, Intellektualnye sistemy. Teoriya i prilozheniya, 27:4 (2023), 40–61
[25] Zhuk D., A simplified proof of the CSP dichotomy conjecture and XY-symmetric operations, 2024, arXiv: 2404.01080 | MR
[26] Kazda A., Mayr P., Zhuk D., “Small promise CSPs that reduce to large CSPs”, Logical Methods in Computer Science (LMCS), 18:3 (2022) | MR | Zbl
[27] Komkov S.A., Tempy rosta proizvolnykh konechnykh struktur, Kand. dis., M., 2022
[28] Chen H., “Quantified constraint satisfaction and the polynomially generated powers property”, Int. Colloquium on Automata. Languages and Programming, Springer, Berlin–Heidelberg, 2008, 197–208 | DOI | MR | Zbl
[29] Komkov S.A., “Moschnosti generiruyuschikh mnozhestv po operatsiyam iz klassov reshetki Posta”, Diskretn. matem., 30:1 (2019), 19–38 | DOI | Zbl
[30] Komkov S.A., “O klassakh funktsii mnogoznachnoi logiki s minimalnym logarifmicheskim tempom rosta”, Diskretn. matem., 31:3 (2020), 47–57 | DOI | Zbl
[31] Komkov S.A., “Novaya formulirovka kriteriya minimalnogo logarifmicheskogo tempa rosta”, Vestn. Mosk. un-ta. Matem. Mekhan., 2020, no. 5, 60–62 | Zbl
[32] Komkov S.A., “Novye po poryadku eksponentsialnye tempy rosta”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:3 (2021), 39–48
[33] Komkov S.A., “Kontinualnost klassov funktsii mnogoznachnoi logiki s minimalnym logarifmicheskim tempom rosta”, Diskretn. matem., 33:3 (2021), 54–63 | DOI
[34] Bystrygova A.V., Parametro-effektivnaya rasshifrovka bulevykh funktsii, Kand. dis., M., 2022
[35] Bystrygova A.V., “Rasshifrovka bulevykh funktsii fiksirovannogo vesa”, Intellektualnye sistemy. Teoriya i prilozheniya, 24:3 (2020), 63–96
[36] Bystrygova A.V., “Rasshifrovka bulevykh funktsii ogranichennogo vesa”, Vestn. Mosk. un-ta. Matem. Mekhan., 2021, no. 6, 14–20 | MR | Zbl
[37] Bystrygova A.V., “Parametro-effektivnaya rasshifrovka bulevykh funktsii iz zamknutykh klassov Posta”, Diskretn. matem., 31:2 (2019), 34–58 | DOI
[38] Bystrygova A.V., “Zaprosy na sravnenie v zadache tochnoi rasshifrovki zamknutykh klassov Posta”, Intellektualnye sistemy. Teoriya i prilozheniya, 26:3 (2022), 88–108
[39] Panteleev P., Kalachev G., “Asymptotically good quantum and locally testable classical LDPC codes”, Proc. 54th Annual ACM SIGACT Symp. on Theory of Computing (New York, USA, 2022), 375–388 | MR | Zbl
[40] Panteleev P., Kalachev G., “Quantum LDPC codes with almost linear minimum distance”, IEEE Trans. Inform. Theory, 68:1 (2022), 213–229 | DOI | MR | Zbl
[41] Panteleev P.A., Kalachev G.V., “Ob asimptoticheskikh khoroshikh semeistvakh klassicheskikh i kvantovykh LDPC”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:4 (2021), 185–188
[42] Dinur I., Evra S., Livne R., Lubotzky A., Mozes S., “Locally testable codes with constant rate, distance, and locality”, Proc. 54th Annual ACM SIGACT Symp. on Theory of Computing (New York, USA, 2022), 357–374 | MR | Zbl
[43] Efimov A.A., Otsenki energopotrebleniya ob'emnykh skhem, Kand. dis., M., 2022
[44] Kalachev G.V., “Nizhnie otsenki moschnosti ploskikh skhem, realizuyuschikh chastichnye bulevy operatory”, Intellektualnye sistemy. Teoriya i prilozheniya, 18:2 (2014), 279–322 | MR
[45] Kalachev G.V., “Ob odnovremennoi minimizatsii ploschadi, moschnosti i glubiny ploskikh skhem, realizuyuschikh chastichnye bulevy operatory”, Intellektualnye sistemy. Teoriya i prilozheniya, 20:2 (2016), 203–266 | MR
[46] Efimov A.A., “Nizhnyaya otsenka energopotrebleniya dlya klassa ob'emnykh skhem”, Intellektualnye sistemy. Teoriya i prilozheniya, 27:1 (2023), 91–133
[47] Efimov A.A., “Verkhnyaya otsenka energopotrebleniya v klasse ob'emnykh skhem”, Intellektualnye sistemy. Teoriya i prilozheniya, 23:1 (2019), 117–132
[48] Efimov A.A., “Verkhnyaya otsenka energopotrebleniya ob'emnykh skhem, realizuyuschikh bulevy operatory”, Intellektualnye sistemy. Teoriya i prilozheniya, 23:2 (2019), 105–124
[49] Efimov A.A., “Otsenki energopotrebleniya dlya klassa ob'emnykh skhem sblizkimi vykhodami”, Intellektualnye sistemy. Teoriya i prilozheniya, 26:3 (2022), 109–150
[50] Gasanov E.E., “Kletochnye avtomaty s lokatorami”, Intellektualnye sistemy. Teoriya i prilozheniya, 24:2 (2020), 120–133
[51] Kalachev G.V., “Zamechaniya k opredeleniyu kletochnogo avtomata s lokatorami”, Intellektualnye sistemy. Teoriya i prilozheniya, 24:4 (2020), 47–56 | MR
[52] Ibragimova D.E., “Slozhenie vektorov na pryamoi s pomoschyu kletochnogo avtomata s lokatorami”, Intellektualnye sistemy. Teoriya i prilozheniya, 26:4 (2022), 134–162
[53] Gasanov E.E., “Kletochnye avtomaty s lokatorami kak model ustroistv s besprovodnoi svyazyu”, Matem. voprosy kibernetiki, 21 (2023), 5–51
[54] Vasilev D.I., “Poisk blizhaishego soseda na pryamoi s pomoschyu kletochnogo avtomata s lokatorami”, Intellektualnye sistemy. Teoriya i prilozheniya, 24:3 (2020), 99–119
[55] Vasilev D.I., Gasanov E.E., “Nizhnyaya otsenka slozhnosti zadachi poiska blizhaishego soseda na pryamoi s pomoschyu kletochnogo avtomata s lokatorami”, Vestn. Mosk. un-ta. Matem. Mekhan., 2023, no. 5, 33–39 | DOI | Zbl
[56] Vasilev D.I., “Poisk blizhaishego soseda na ploskosti s pomoschyu kletochnogo avtomata s lokatorami”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:4 (2021), 83–87
[57] Kudryavtsev V.B., Gasanov E.E., Podkolzin A.S., Teoriya intellektualnykh sistem, V 4 kn., v. 4, Teoriya avtomatov, Izdatelskie resheniya, M., 2018
[58] Gasanov E.E., “Lineinyi po poryadku algoritm umnozheniya chisel s pomoschyu dvumernogo kletochnogo avtomata s lokatorami”, Mezhdunar. nauch. konf. “Matematika v sozvezdii nauk” k yubileyu akademika V. A. Sadovnichego (Moskva, 1–2 aprelya 2024 g.), M., 2024, 316–318
[59] Gasanov E.E., Propazhin A.A., “Realizatsiya baz dannykh tipa “klyuch-znachenie” kletochnymi avtomatami s lokatorami”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:4 (2021), 108–112
[60] Galatenko A.V., Pankratev A.E., Staroverov V.M., “Algoritmy proverki nekotorykh svoistv $n$-kvazigrupp”, Programmirovanie, 2022, no. 1, 40–53 | DOI | Zbl
[61] Galatenko A.V., Galatenko V.V., Pankratev A.E., “O silnoi polinomialnoi polnote pochti vsekh kvazigrupp”, Matem. zametki, 111:1 (2022), 8–14 | DOI | MR | Zbl
[62] Galatenko A.V., Nosov V.A., Pankratev A.E., Tsaregorodtsev K.D., “O porozhdenii $n$-kvazigrupp s pomoschyu pravilnykh semeistv funktsii”, Diskretn. matem., 35:1 (2023), 35–53 | DOI
[63] Galatenko A., Pankratiev A., Staroverov V., “Generation of proper families of functions”, Lobachevskii J. Math., 43:3 (2022), 571–581 | DOI | MR | Zbl
[64] Chakrabarti S., Galatenko A., Nosov V., Pankratiev A., Tiwari S., “Quasigroups generated by shift registers and Feistel networks”, Quasigroups and Related Systems, 31:2 (2023), 207–220 | MR | Zbl
[65] Cherednik I.V., Ispolzovanie binarnykh funktsionalnykh setei pri postroenii kratno tranzitivnykh mnozhestv blochnykh preobrazovanii, Kand. dis., M., 2021