Shalyto Anatoly Abramovich

Publications in Math-Net.Ru

1. Towards neural routing with verified bounds on performance
   
   Model. Anal. Inform. Sist., 29:3 (2022),  228–245
2. 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. Method of the joint clustering in network and correlation spaces
   
   Model. Anal. Inform. Sist., 27:2 (2020),  180–193
4. Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
   
   Avtomat. i Telemekh., 2016, no. 3,  137–151
5. 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
6. Application of genetic programming and model checking for finite-state machine induction
   
   Tr. SPIIRAN, 15 (2010),  123–135
7. 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
8. Automata-based approach for correct Java Card-program
   
   Model. Anal. Inform. Sist., 15:3 (2008),  47–55
9. Logic Control and “Reactive” Systems: Algorithmization and Programming
   
   Avtomat. i Telemekh., 2001, no. 1,  3–39
10. Linearized graph algorithms for Boolean formulas: independent-fragment design method
    
    Avtomat. i Telemekh., 1998, no. 9,  142–154
11. Implementation of Systems of Boolean Functions by Linear Arithmetic Polynomials with Masking
    
    Avtomat. i Telemekh., 1997, no. 3,  200–215
12. The Use Graph Diagrams and Transition Graphs in Program Implementation of Logistic Control Problems. I
    
    Avtomat. i Telemekh., 1996, no. 7,  144–169
13. The Use of Graph Diagrams and Transition Graphs in Program Implementation of Logistic Control Problems. I
    
    Avtomat. i Telemekh., 1996, no. 6,  148–158
14. Implementation of Boolean Functions by One Linear Arithmetic Polynomial with Masking
    
    Avtomat. i Telemekh., 1996, no. 1,  158–170
15. Realization of systems of Boolean functions by linear arithmetic polynomials
    
    Avtomat. i Telemekh., 1993, no. 3,  135–151
16. Representation of Boolean functions as arithmetical polinomials
    
    Avtomat. i Telemekh., 1988, no. 4,  138–147
17. Binary Programs and Their Realization by Asynchronous Automata
    
    Probl. Peredachi Inf., 23:1 (1987),  89–96
18. A set of transformations of certain forms of representation of Boolean functions
    
    Avtomat. i Telemekh., 1985, no. 11,  120–127
19. Adjustible binary procedures and cyclic programs
    
    Avtomat. i Telemekh., 1984, no. 11,  112–119
20. 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