|
|
|
Publications in Math-Net.Ru |
Citations |
|
2009 |
| 1. |
R. G. Mubarakzjanov, “On the Complexity of Randomized Read-once Branching Programs”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009), 107–113  |
|
2006 |
| 2. |
R. G. Mubarakzyanov, “Lower bounds for the complexity of probabilistic binary programs with a large ordered part”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 6, 56–64   ; Russian Math. (Iz. VUZ), 50:6 (2006), 54–62 |
1
|
|
2005 |
| 3. |
R. G. Mubarakzyanov, “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 ; Russian Math. (Iz. VUZ), 49:11 (2005), 32–40 |
|
2004 |
| 4. |
R. G. Mubarakzyanov, “Deterministic and probabilistic error-free ordered read-once binary programs are equivalent”, Diskretn. Anal. Issled. Oper., Ser. 1, 11:2 (2004), 80–90 |
|
2000 |
| 5. |
R. G. Mubarakzyanov, “On complexity classes defined by binary programs of bounded width”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:1 (2000), 67–78 |
|
1991 |
| 6. |
R. G. Mubarakzyanov, “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 ; Soviet Math. (Iz. VUZ), 35:12 (1991), 87–89 |
| 7. |
R. G. Mubarakzyanov, “On the $\varepsilon$-modeling of the behavior of probabilistic automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 1991, no. 4, 48–57 ; Soviet Math. (Iz. VUZ), 35:4 (1991), 46–54 |
|
1987 |
| 8. |
R. G. Mubarakzyanov, “Finiteness of a set of noncollinear vectors generated by a family of linear operators”, Izv. Vyssh. Uchebn. Zaved. Mat., 1987, no. 4, 82–84 ; Soviet Math. (Iz. VUZ), 31:4 (1987), 114–117 |
|
1985 |
| 9. |
R. G. Mubarakzyanov, “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 ; Soviet Math. (Iz. VUZ), 29:7 (1985), 27–34 |
|
| Organisations |
|
| |
|
|
Contact us: