Mamatov Yurii Aleksandrovich

Publications in Math-Net.Ru

1. Queueing systems with probabilistic priorities
   
   Avtomat. i Telemekh., 1985, no. 9,  159–162
2. A method for the synthesis of planar disjunctive normal forms for logic functions
   
   Zh. Vychisl. Mat. Mat. Fiz., 20:4 (1980),  1075–1077
3. On a principle for obtaining high (exponential for some parameter values) lower bounds for the complexity of disjunctive normal forms
   
   Dokl. Akad. Nauk SSSR, 245:5 (1979),  1054–1057
4. Concerning a principle for obtaining lower bounds on the complexity of formulas
   
   Dokl. Akad. Nauk SSSR, 245:4 (1979),  782–784
5. Proof of statistical optimality of the Jablonskii–Quine–McCluskey algorithm in the problem of finding a shortest covering
   
   Dokl. Akad. Nauk SSSR, 229:5 (1976),  1048–1050
6. Asymptotic properties of shortest coverings
   
   Dokl. Akad. Nauk SSSR, 229:4 (1976),  801–803
7. Estimation of the number of functions of the algebra of logic that can be realized by plane disjunctive normal forms
   
   Zh. Vychisl. Mat. Mat. Fiz., 16:1 (1976),  170–188