|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
I. P. Buzhinsky, A. A. Shalyto, “Towards neural routing with verified bounds on performance”, Model. Anal. Inform. Sist., 29:3 (2022), 228–245   |
|
2020 |
| 2. |
A. O. Bassin, M. V. Buzdalov, A. A. Shalyto, “The “one-fifth rule” with rollbacks for self-adjustment of the population size in the $(1 + (\lambda,\lambda))$ genetic algorithm”, Model. Anal. Inform. Sist., 27:4 (2020), 488–508  |
| 3. |
A. N. Gainullina, A. A. Shalyto, A. A. Sergushichev, “Method of the joint clustering in network and correlation spaces”, Model. Anal. Inform. Sist., 27:2 (2020), 180–193 |
|
2016 |
| 4. |
D. S. Chivilikhin, V. I. Ulyantsev, A. A. Shalyto, “Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas”, Avtomat. i Telemekh., 2016, no. 3, 137–151 ; Autom. Remote Control, 77:3 (2016), 473–484   |
4
|
|
2013 |
| 5. |
A. A. Sergushichev, A. V. Alexandrov, S. V. Kazakov, F. N. Tsarev, A. A. Shalyto, “Combining de Bruijn graphs, overlap graphs and microassembly for de novo genome assembly”, Izv. Saratov Univ. Math. Mech. Inform., 13:2(2) (2013), 51–57 |
4
|
|
2010 |
| 6. |
K. V. Egorov, F. N. Tsarev, A. A. Shalyto, “Application of genetic programming and model checking for finite-state machine induction”, Tr. SPIIRAN, 15 (2010), 123–135 |
|
2009 |
| 7. |
L. V. Stolyarov, I. R. Dedinskii, A. A. Shalyto, “Translation of discrete finite automata descriptions from Microsoft Visio format to source code in C language”, Prikl. Diskr. Mat., 2009, no. supplement № 1, 81–83 |
|
2008 |
| 8. |
A. A. Klebanov, A. A. Shalyto, “Automata-based approach for correct Java Card-program”, Model. Anal. Inform. Sist., 15:3 (2008), 47–55 |
|
2001 |
| 9. |
A. A. Shalyto, “Logic Control and “Reactive” Systems: Algorithmization and Programming”, Avtomat. i Telemekh., 2001, no. 1, 3–39  ; Autom. Remote Control, 62:1 (2001), 1–29 |
26
|
|
1998 |
| 10. |
B. P. Kuznetsov, A. A. Shalyto, “Linearized graph algorithms for Boolean formulas: independent-fragment design method”, Avtomat. i Telemekh., 1998, no. 9, 142–154 ; Autom. Remote Control, 59:9 (1998), 1317–1326 |
|
1997 |
| 11. |
V. N. Kondrat'yev, A. A. Shalyto, “Implementation of Systems of Boolean Functions by Linear Arithmetic Polynomials with Masking”, Avtomat. i Telemekh., 1997, no. 3, 200–215 ; Autom. Remote Control, 58:3 (1997), 492–503 |
|
1996 |
| 12. |
A. A. Shalyto, “The Use Graph Diagrams and Transition Graphs in Program Implementation of Logistic Control Problems. I”, Avtomat. i Telemekh., 1996, no. 7, 144–169 ; Autom. Remote Control, 57:7 (1996), 1027–1045 |
1
|
| 13. |
A. A. Shalyto, “The Use of Graph Diagrams and Transition Graphs in Program Implementation of Logistic Control Problems. I”, Avtomat. i Telemekh., 1996, no. 6, 148–158 ; Autom. Remote Control, 57:6 (1996), 890–898 |
1
|
| 14. |
V. N. Kondratyev, A. A. Shalyto, “Implementation of Boolean Functions by One Linear Arithmetic Polynomial with Masking”, Avtomat. i Telemekh., 1996, no. 1, 158–170 ; Autom. Remote Control, 57:1 (1996), 127–137 |
2
|
|
1993 |
| 15. |
V. N. Kondrat'ev, A. A. Shalyto, “Realization of systems of Boolean functions by linear arithmetic polynomials”, Avtomat. i Telemekh., 1993, no. 3, 135–151 ; Autom. Remote Control, 54:3 (1993), 472–488 |
2
|
|
1988 |
| 16. |
V. L. Artyukhov, V. N. Kondrat'ev, A. A. Shalyto, “Representation of Boolean functions as arithmetical polinomials”, Avtomat. i Telemekh., 1988, no. 4, 138–147 ; Autom. Remote Control, 49:4 (1988), 508–515 |
2
|
|
1987 |
| 17. |
Yu. L. Sagalovich, A. A. Shalyto, “Binary Programs and Their Realization by Asynchronous Automata”, Probl. Peredachi Inf., 23:1 (1987), 89–96 ; Problems Inform. Transmission, 23:1 (1987), 74–80 |
|
1985 |
| 18. |
B. P. Kuznetsov, A. A. Shalyto, “A set of transformations of certain forms of representation of Boolean functions”, Avtomat. i Telemekh., 1985, no. 11, 120–127 ; Autom. Remote Control, 46 (1985), 1450–1457 |
|
1984 |
| 19. |
V. L. Artyukhov, B. P. Kuznetsov, A. A. Shalyto, “Adjustible binary procedures and cyclic programs”, Avtomat. i Telemekh., 1984, no. 11, 112–119 ; Autom. Remote Control, 45:11 (1984), 1481–1488 |
|
1981 |
| 20. |
V. L. Artyukhov, G. A. Kopeikin, A. A. Shalyto, “On estimating the implementation complexity of boolean formulae in terms of tree-like structures of adjustible modules”, Avtomat. i Telemekh., 1981, no. 11, 124–130 ; Autom. Remote Control, 42:11 (1981), 1532–1538 |
|
| Organisations |
|
| |
|
|
Contact us: