Valiev Mars Kotdusovich

Publications in Math-Net.Ru

1. On complexity of verification of nondeterministic probabilistic multiagent systems
   
   Model. Anal. Inform. Sist., 17:4 (2010),  41–50
2. Probabilistic multiagent systems: semantics and verification
   
   Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2008, no. 11,  9–22
3. Using LDAP Directory Service for Representation of Metainformation in Global Computing Systems
   
   Keldysh Institute preprints, 2000, 029
4. LDAP Directory Service as a Tool For Implementation of Distributed Information Systems
   
   Keldysh Institute preprints, 2000, 023
5. Examples of universal finitely presented groups
   
   Dokl. Akad. Nauk SSSR, 211:2 (1973),  265–268
6. The complexity of the word problem for finitely presented groups
   
   Algebra Logika, 8:1 (1969),  5–43
7. A theorem of G. Higman
   
   Algebra Logika, 7:3 (1968),  9–22


8. Mikhail Abramovich Taitslin (1936–2013)
   
   Sib. Èlektron. Mat. Izv., 10 (2013),  54–65
9. Поправки к статье “Примеры универсальных конечно-определенных групп” (ДАН, т. 211, № 2, 1973 г.)
   
   Dokl. Akad. Nauk SSSR, 215:3 (1974),  10