|
|
Publications in Math-Net.Ru |
Citations |
|
1980 |
1. |
V. A. Tuzov, “A method of describing programming languages”, Dokl. Akad. Nauk SSSR, 250:3 (1980), 581–584 |
2. |
V. A. Tuzov, “Functional grammars”, Zap. Nauchn. Sem. LOMI, 102 (1980), 123–137 ; J. Soviet Math., 22:2 (1983), 1239–1248 |
|
1971 |
3. |
V. A. Tuzov, “Optimal schemes of algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 11:5 (1971), 1282–1289 ; U.S.S.R. Comput. Math. Math. Phys., 11:5 (1971), 232–241 |
|
1970 |
4. |
V. A. Tuzov, “Graph schemes with associative calculus”, Zh. Vychisl. Mat. Mat. Fiz., 10:1 (1970), 132–145 ; U.S.S.R. Comput. Math. Math. Phys., 10:1 (1970), 172–190 |
|
1969 |
5. |
V. A. Tuzov, “Canonical assumptions for graph-schemes”, Zh. Vychisl. Mat. Mat. Fiz., 9:2 (1969), 486–490 ; U.S.S.R. Comput. Math. Math. Phys., 9:2 (1969), 324–331 |
|
1968 |
6. |
V. A. Tuzov, “Discrimination of closed subgraphs”, Zh. Vychisl. Mat. Mat. Fiz., 8:6 (1968), 1385–1387 ; U.S.S.R. Comput. Math. Math. Phys., 8:6 (1968), 276–281 |
7. |
V. A. Tuzov, “The minimization of graph schemes”, Zh. Vychisl. Mat. Mat. Fiz., 8:4 (1968), 922–928 ; U.S.S.R. Comput. Math. Math. Phys., 8:4 (1968), 317–327 |
8. |
V. A. Tuzov, “Regular sets of circuits of a graph”, Zh. Vychisl. Mat. Mat. Fiz., 8:2 (1968), 492–496 ; U.S.S.R. Comput. Math. Math. Phys., 8:2 (1968), 360–368 |
|
Organisations |
|
|
|
|