Publications in Math-Net.Ru
-
Modules of cyclic programs: structure and complexity
Avtomat. i Telemekh., 1999, no. 2, 151–165
-
Linearized graph algorithms for Boolean formulas: independent-fragment design method
Avtomat. i Telemekh., 1998, no. 9, 142–154
-
Computation times on linear binary graphs
Avtomat. i Telemekh., 1994, no. 9, 166–172
-
Plausibility of controlling signals in the loop of logical control
Avtomat. i Telemekh., 1993, no. 10, 160–167
-
A set of transformations of certain forms of representation of Boolean functions
Avtomat. i Telemekh., 1985, no. 11, 120–127
-
Adjustible binary procedures and cyclic programs
Avtomat. i Telemekh., 1984, no. 11, 112–119
© , 2026