|
|
Publications in Math-Net.Ru
-
On relationships between complexity classes of Turing machines
Zh. Vychisl. Mat. Mat. Fiz., 57:4 (2017), 730–743
-
Work tree andmassively parallel processing
Inform. Primen., 5:2 (2011), 90–99
-
Model of parallel round of work trees
Sistemy i Sredstva Inform., 21:1 (2011), 47–61
-
Backup using snapshots
Inform. Primen., 3:2 (2009), 15–24
-
Coordinating information processing in the distributed systems
Sistemy i Sredstva Inform., 2009, no. 19, 75–86
-
A broadcast messaging system based on distributed file system primitives
Sistemy i Sredstva Inform., 2009, no. 19, 63–74
-
Service application tasks execution control in distributed environment on the basis of resource model
Sistemy i Sredstva Inform., 2008, no. 18, 71–81
-
The algorithms of parallel accomplishment of service applications in distributed environment
Sistemy i Sredstva Inform., 2008, no. 18, 49–70
-
Planning of service applications accomplishment in distributed environment
Sistemy i Sredstva Inform., 2008, no. 18, 36–48
-
Service applications for working with hierarchical data within distributed file system
Sistemy i Sredstva Inform., 2008, no. 18, 20–35
-
Means providing applications fault tolerance
Inform. Primen., 1:1 (2007), 14–26
-
Методы реализации отказоустойчивости приложений с недетерминированным поведением
Sistemy i Sredstva Inform., 2006, no. 16, 374–385
-
On two subclasses of Turing machines which can be reduced to finite automata
Dokl. Akad. Nauk SSSR, 187:1 (1969), 9–10
-
On sets which are enumerable and solvable by automata
Dokl. Akad. Nauk SSSR, 142:5 (1962), 1005–1006
© , 2025