Mubarakzyanov Rustam Gamirovich

Publications in Math-Net.Ru

1. On the Complexity of Randomized Read-once Branching Programs
   
   Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  107–113
2. Lower bounds for the complexity of probabilistic binary programs with a large ordered part
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 6,  56–64
3. The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2005, no. 11,  34–43
4. Deterministic and probabilistic error-free ordered read-once binary programs are equivalent
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 11:2 (2004),  80–90
5. On complexity classes defined by binary programs of bounded width
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 7:1 (2000),  67–78
6. Some improvements of the estimates in our paper: "Intersection of a space and a polyhedral cone"
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1991, no. 12,  87–89
7. On the $\varepsilon$-modeling of the behavior of probabilistic automata
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1991, no. 4,  48–57
8. Finiteness of a set of noncollinear vectors generated by a family of linear operators
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1987, no. 4,  82–84
9. An automaton that leaves invariant a class of random sequences with a finite set of states
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 7,  21–25