Khrapchenko Valerii Mikhailovich

Publications in Math-Net.Ru

1. The Lupanov methods and their importance for the formation of the circuit synthesis theory
   
   Chebyshevskii Sb., 17:2 (2016),  184–195
2. A simplified proof of a lower complexity estimate
   
   Diskr. Mat., 25:2 (2013),  82–84
3. The fundamental difference between depth and delay
   
   Diskr. Mat., 20:3 (2008),  51–72
4. On one of the possibilities of sharpening estimates for the delay of a parallel adder
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 14:1 (2007),  86–93
5. The works of R. G. Nigmatullin on lower bounds for complexity
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 7:1 (2000),  18–31
6. New inequality relations between depth and delay
   
   Diskr. Mat., 7:4 (1995),  77–85
7. Depth and delay in a network
   
   Dokl. Akad. Nauk SSSR, 241:6 (1978),  1281–1284
8. The complexity of the realization of symmetrical functions by formulae
   
   Mat. Zametki, 11:1 (1972),  109–120
9. Method of determining lower bounds for the complexity of $P$-schemes
   
   Mat. Zametki, 10:1 (1971),  83–92
10. Complexity of the realization of a linear function in the class of $\Pi$-circuits
    
    Mat. Zametki, 9:1 (1971),  35–40
11. A method of converting a multiseries code into a singleseries one
    
    Dokl. Akad. Nauk SSSR, 148:2 (1963),  296–299


12. Mathematician Oleg Borisovich Lupanov (1932–2006)
    
    Chebyshevskii Sb., 17:2 (2016),  6–20