Shakhbazyan K V

Publications in Math-Net.Ru

1. EMSO-definability of some languages with event structures
   
   Zap. Nauchn. Sem. POMI, 304 (2003),  128–140
2. On process languages in finite graphs
   
   Zap. Nauchn. Sem. POMI, 248 (1998),  205–215
3. The stabilization test for pipelines
   
   Zap. Nauchn. Sem. POMI, 248 (1998),  187–204
4. Lattices of processes for graphs
   
   Zap. Nauchn. Sem. POMI, 202 (1992),  135–153
5. Representation of processes in graphs
   
   Dokl. Akad. Nauk SSSR, 308:2 (1989),  278–280
6. Questions of decomposition in conveyor computer
   
   Zap. Nauchn. Sem. LOMI, 159 (1987),  47–55
7. A spanning-tree algorithm for constructing streams in pipelines
   
   Zap. Nauchn. Sem. LOMI, 159 (1987),  40–46
8. Maximum number of flows in a pipeline
   
   Zap. Nauchn. Sem. LOMI, 139 (1984),  22–40
9. Shifting algorithm for the optimal structural schedules
   
   Zap. Nauchn. Sem. LOMI, 124 (1983),  73–92
10. On two sequencing problems
    
    Zap. Nauchn. Sem. LOMI, 124 (1983),  44–72
11. Effective optimization methods for single-machine scheduling (Survey)
    
    Zap. Nauchn. Sem. LOMI, 111 (1981),  195–217
12. On scheduling problems $n|1|\sum C_i(t)$
    
    Zap. Nauchn. Sem. LOMI, 102 (1980),  147–155
13. Structural schedules in the scheduling problems
    
    Zap. Nauchn. Sem. LOMI, 102 (1980),  138–146
14. The ordering of structural set of tasks minimizing the total cost
    
    Zap. Nauchn. Sem. LOMI, 90 (1979),  229–264
15. Structured solutions in scheduling problems
    
    Zap. Nauchn. Sem. LOMI, 80 (1978),  239–248
16. Minimization of the total cost in the problem of parallel ordering of $n$ independent tasks
    
    Dokl. Akad. Nauk SSSR, 237:4 (1977),  790–792
17. Optimal schedulings with gaps for independent jobs in a service system with $N$ servers
    
    Zap. Nauchn. Sem. LOMI, 70 (1977),  205–231
18. A survey of scheduling methods for multiprocessor systems
    
    Zap. Nauchn. Sem. LOMI, 54 (1975),  229–258
19. Some algorithm of the construction of the optimal Schedule for parallelsequential networks
    
    Zap. Nauchn. Sem. LOMI, 48 (1974),  200–204
20. Branch and bound method for parallel sequencing problems
    
    Zap. Nauchn. Sem. LOMI, 35 (1973),  146–155
21. Achoice of numeration in parallel ordering problems
    
    Zap. Nauchn. Sem. LOMI, 18 (1970),  27–30
22. Solution of some problems of parallel ordering
    
    Zap. Nauchn. Sem. LOMI, 18 (1970),  16–26
23. On the main conceptions of parallel ordering
    
    Zap. Nauchn. Sem. LOMI, 18 (1970),  6–15
24. Scheme programming languages
    
    Dokl. Akad. Nauk SSSR, 188:1 (1969),  45–48
25. Specialization of the A-language for linear algebra problems
    
    Trudy Mat. Inst. Steklov., 96 (1968),  48–58
26. A functional algorithmic language
    
    Trudy Mat. Inst. Steklov., 96 (1968),  16–47
27. A master routine which compiles a program
    
    Zh. Vychisl. Mat. Mat. Fiz., 3:6 (1963),  1134–1137
28. The calculus of programming functional operations
    
    Trudy Mat. Inst. Steklov., 66 (1962),  45–76