Karavai Mikhail Fedorovich

Publications in Math-Net.Ru

1. Machine learning for diagnosis of diseases with complete gene expression profile
   
   Avtomat. i Telemekh., 2023, no. 7,  83–92
2. Instantaneous learning in pattern recognition
   
   Avtomat. i Telemekh., 2022, no. 3,  144–155
3. Optimum multidimensional tori based on low-port routers and hubs
   
   Probl. Upr., 2020, no. 5,  56–64
4. Expanding the capabilities of the Angara system area network
   
   Probl. Upr., 2020, no. 2,  47–56
5. Topological reserves of flattened networks
   
   Vestn. YuUrGU. Ser. Vych. Matem. Inform., 5:2 (2016),  84–94
6. Small-diametr system area network composed from small-port routers
   
   UBS, 56 (2015),  201–210
7. Multiple combinatorial block diagrams
   
   Avtomat. i Telemekh., 2013, no. 6,  121–132
8. System area networks latent reserves of supercomputers Blue Waters (IBM) and Gemini (CRAY)
   
   Program Systems: Theory and Applications, 4:3 (2013),  53–70
9. Extended generaized hypercube as fail-safe system network for multiprocessor systems
   
   UBS, 45 (2013),  344–371
10. Topological reserve of supercomputer interconnect
    
    UBS, 41 (2013),  395–423
11. Expanded block-diagrams for “ideal” system area networks
    
    Probl. Upr., 2012, no. 4,  45–51
12. Distributed full switch as ideal system area network for multiprocessor computers
    
    UBS, 34 (2011),  92–116
13. An invariant extension method for system area networks of multicore computational systems. An ideal system network
    
    Avtomat. i Telemekh., 2010, no. 12,  166–177
14. Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
    
    Avtomat. i Telemekh., 2009, no. 2,  153–170
15. Minimized embedding of arbitrary hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II. Grids and $k$-fault-tolerance
    
    Avtomat. i Telemekh., 2005, no. 2,  175–189
16. Minimized embedding of arbitrary hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. I. One-fault-tolerant structures
    
    Avtomat. i Telemekh., 2004, no. 12,  159–177
17. An invariant-group approach to investigation of $k$-fault-tolerant structures
    
    Avtomat. i Telemekh., 2000, no. 1,  144–156
18. Application of the Symmetry Theory in the Analysis and Synthesis of Fault Tolerant Systems
    
    Avtomat. i Telemekh., 1996, no. 6,  159–173
19. A group-invariant approach to the design of fault-tolerant systems
    
    Dokl. Akad. Nauk, 347:2 (1996),  175–179
20. Switching networks in multiprocessor systems with common control: the state-of-art
    
    Avtomat. i Telemekh., 1989, no. 2,  3–29
21. On minimal redundancy on reconfigurable uniform multiprocessor systems
    
    Avtomat. i Telemekh., 1988, no. 2,  149–159
22. Analysis of reliability characteristics of self-checkable redundant structures
    
    Avtomat. i Telemekh., 1979, no. 8,  105–119
23. An algorithm of construction of a multiple-fault detection test for combinational circuits
    
    Avtomat. i Telemekh., 1975, no. 1,  162–170


24. East – West Design & Test Conference
    
    Probl. Upr., 2003, no. 3,  76