Losev Georgii Filippovich

Publications in Math-Net.Ru

1. Classes of local algorithms for computing information
   
   Dokl. Akad. Nauk, 331:4 (1993),  413–415
2. Local algorithms for computing information and the problem of a minimal covering
   
   Dokl. Akad. Nauk SSSR, 267:3 (1982),  544–548
3. Local algorithms for computing information with nonfixed memory
   
   Dokl. Akad. Nauk SSSR, 264:3 (1982),  547–550
4. Local algorithms for the simplification of disjunctive normal forms of Boolean functions
   
   Zh. Vychisl. Mat. Mat. Fiz., 18:3 (1978),  728–734
5. Conditionally majorant local algorithms with arbitrary memory for problems of the synthesis of minimal coverings
   
   Zh. Vychisl. Mat. Mat. Fiz., 14:3 (1974),  744–755
6. The best local algorithm, for the construction of the sum of the disjunctive normal forms of a Boolean function, that uses neighborhoods of minimal order
   
   Zh. Vychisl. Mat. Mat. Fiz., 14:2 (1974),  470–478
7. The best local algorithm of index $1$ for the construction of the sum of the irredundant disjunctive normal forms of a Boolean function
   
   Dokl. Akad. Nauk SSSR, 212:4 (1973),  816–817
8. On a test of M. Izumi and S. Izumi for the convergence of Fourier series
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1973, no. 5,  40–44