|
|
|
Publications in Math-Net.Ru |
Citations |
|
2010 |
| 1. |
M. K. Valiev, M. I. Dekhtyar', “On complexity of verification of nondeterministic probabilistic multiagent systems”, Model. Anal. Inform. Sist., 17:4 (2010), 41–50  |
1
|
|
2008 |
| 2. |
M. K. Valiev, M. I. Dekhtyar', “Probabilistic multiagent systems: semantics and verification”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2008, no. 11, 9–22  |
|
2000 |
| 3. |
M. K. Valiev, E. L. Kitaev, M. I. Slepenkov, “Using LDAP Directory Service for Representation of Metainformation in Global Computing Systems”, Keldysh Institute preprints, 2000, 029 |
| 4. |
M. K. Valiev, E. L. Kitaev, M. I. Slepenkov, “LDAP Directory Service as a Tool For Implementation of Distributed Information Systems”, Keldysh Institute preprints, 2000, 023 |
|
1973 |
| 5. |
M. K. Valiev, “Examples of universal finitely presented groups”, Dokl. Akad. Nauk SSSR, 211:2 (1973), 265–268   |
2
|
|
1969 |
| 6. |
M. K. Valiev, “The complexity of the word problem for finitely presented groups”, Algebra Logika, 8:1 (1969), 5–43 |
|
1968 |
| 7. |
M. K. Valiev, “A theorem of G. Higman”, Algebra Logika, 7:3 (1968), 9–22 |
|
|
|
2013 |
| 8. |
D. A. Archangelsky, B. S. Baizhanov, O. V. Belegradek, V. Ya. Belyaev, L. A. Bokut, M. K. Valiev, S. K. Vodopyanov, M. Gitik, Yu. S. Gurevich, D. O. Daderkin, A. M. Dekhtyar, M. I. Dekhtyar, A. Ya. Dikovsky, S. M. Dudakov, E. I. Zelmanov, B. I. Zilber, S. L. Krushkal, S. S. Kutateladze, Yu. V. Matiyasevich, G. E. Mints, I. Kh. Musikaev, A. K. Rebrov, Yu. G. Reshetnyak, A. L. Semenov, A. P. Stolboushkin, I. A. Taimanov, B. A. Trakhtenbrot, “Mikhail Abramovich Taitslin (1936–2013)”, Sib. Èlektron. Mat. Izv., 10 (2013), 54–65 |
|
1974 |
| 9. |
M. K. Valiev, “Поправки к статье “Примеры универсальных конечно-определенных групп” (ДАН, т. 211, № 2, 1973 г.)”, Dokl. Akad. Nauk SSSR, 215:3 (1974), 10 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: