Publications in Math-Net.Ru
-
An algorithm for constructing irredundant tests for binary tables
Zh. Vychisl. Mat. Mat. Fiz., 38:4 (1998), 698–704
-
Irredundant test for binary tables
Zh. Vychisl. Mat. Mat. Fiz., 37:2 (1997), 243–249
-
On complete checking tests for quasi-iteration-free switching circuits
Diskr. Mat., 8:3 (1996), 111–118
-
On correction of the totally of recognition algorithms by schemes of functional elements
Dokl. Akad. Nauk SSSR, 255:2 (1980), 286–290
-
On the design of circuits which correct the breaking of contacts
Dokl. Akad. Nauk SSSR, 159:2 (1964), 290–293
© , 2026