Dekhtyar' Mikhail Iosifovich

Publications in Math-Net.Ru

1. PDA with independent counters
   
   Model. Anal. Inform. Sist., 22:2 (2015),  176–196
2. On complexity of verification of nondeterministic probabilistic multiagent systems
   
   Model. Anal. Inform. Sist., 17:4 (2010),  41–50
3. Probabilistic multiagent systems: semantics and verification
   
   Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2008, no. 11,  9–22
4. The complexity of relative computations
   
   Dokl. Akad. Nauk SSSR, 214:5 (1974),  999–1001
5. Impossibility of eliminating complete enumeration in computing functions from their diagrams
   
   Dokl. Akad. Nauk SSSR, 189:4 (1969),  748–751


6. Mikhail Abramovich Taitslin (1936–2013)
   
   Sib. Èlektron. Mat. Izv., 10 (2013),  54–65
7. Поправки к статье “О сложности относительных вычислений” (ДАН, т. 214, № 5, 1974 г.)
   
   Dokl. Akad. Nauk SSSR, 218:3 (1974),  10