Result 1 to 20 of 34 total
Application of graphs to programming. (Russian)
Kasyanov, V. N. (ed.), Supercomputing support and internet-oriented technologies. Novosibirsk: Institut Sistem Informatiki Im. A. P. Ershova SO RAN, 139-167 (2001).
1
Functional language Sisal 3. 0. (Russian)
Kasyanov, V. N. (ed.), Supercomputing support and internet-oriented technologies. Novosibirsk: Institut Sistem Informatiki Im. A. P. Ershova SO RAN, 54-67 (2001).
2
At the 16th IFIP World Computer Congress. (Russian)
Kasyanov, V. N. (ed.), Supercomputing support and internet-oriented technologies. Novosibirsk: Institut Sistem Informatiki Im. A. P. Ershova SO RAN, 9-30 (2001).
3
Problems of an information support for humanitarian researches in culture. (Russian)
Kas’yanov, V. N. (ed.), Problems in informatics systems and programming. Novosibirsk: Institut Sistem Informatiki Im. A. P. Ershova SO RAN, 188-201 (1999).
4
Hierarchical graphs and graph models: Problems of visual processing. (Russian)
Kas’yanov, V. N. (ed.), Problems in informatics systems and programming. Novosibirsk: Institut Sistem Informatiki Im. A. P. Ershova SO RAN, 7-32 (1999).
5
Problems in informatics systems and programming. (Problemy sistem informatiki i programmirovaniya.) (Russian)
Novosibirsk: Institut Sistem Informatiki Im. A. P. Ershova SO RAN, 225 p. (1999).
6
Explanatory dictionary of graph theory in computer science and programming. Ed. by L. S. Mel’nikov. (Tolkovyj slovar’ po teorii grafov v informatike i programmirovanii.) (Russian)
Novosibirsk: Nauka. Sibirskoe Predpriyatie RAN. 288 p. (1999).
7
Graph theory. Algorithms of contourless graph processing. Ed. by I. V. Pottosin. (Teoriya grafov. Algoritmy obrabotki beskonturnykh grafov.) (Russian)
Novosibirsk: Nauka. Sibirskoe Predpriyatie RAN. 385 p. (1998).
8
Iterative switching networks. (English)
Bull. Novosib. Comput. Cent., Ser. Comput. Sci. 6, 17-27 (1997).
9
Parallel fine-grained architectures and the compilers design problem. (Russian)
Bokut’, L. A. (ed.) et al., Siberian conference on applied and industrial mathematics dedicated to the memory of L. V. Kantorovich. Vol. 1. Novosibirsk (Russia), July 25‒29, 1994. Novosibirsk: Izdatel’stvo Instituta Matematiki SO RAN. 31-38 (1997).
10
Optimizing transformations in paralleling compilers. (English)
Program. Comput. Softw. 22, No. 6, 279-290 (1996).
11
On completeness of mechanism of annotation-directives. (English)
Bull. Novosib. Comput. Cent., Ser. Comput. Sci. 3, 59-68 (1995).
12
Graph theory: algorithms of tree processing. Ed. by V. E. Kotov. (Teoriya grafov: algoritmy obrabotki derev’ev.) (Russian)
Novosibirsk: Nauka. 361 p. (1994).
13
Transformation methods and tools for design of efficient and reliable programs. (English)
Cybern. Syst. Anal. 29, No. 2, 177-184 (1993).
14
Transformation methods and tools for design of efficient and reliable programs. (English)
Cybern. Syst. Anal. 29, No.2, 177-184 (1993); translation from Kibern. Sist. Anal. 1993, No.2, 30-40 (1993).
15
Adaptive conditional filtering of discrete random processes for parametric a-priori indeterminancy. (English)
J. Autom. Inf. Sci. 25, No.4, 50-56 (1992); translation from Avtomatika 1992, No.4, 55-61 (1992).
16
Conditional filtering of discrete random processes. (English)
Sov. J. Autom. Inf. Sci. 22, No.3, 66-70 (1989); translation from Avtomatika 1989, No.3, 58-62 (1989).
17
Algorithms on trees. (Algoritmy na derev’yakh.) (Russian)
Novosibirsk: Vychislitel’nyj Tsentr SO AN SSSR, 312 p. (1989).
18
Program annotation and transformation. (English)
Program. Comput. Softw. 15, No.4, 155-164 (1989); translation from Programmirovanie 1989, No.4, 3-16 (1989).
19
Optimizing transformations of programs. (Optimiziruyushchie preobrazovaniya programm.) (Russian)
Bibliotechka Programmista, 55. Moskva: Nauka. 336 p. R. 1.30 (1988).
20
Result 1 to 20 of 34 total
Start
Contact
Print
General Help
