Tushkina T A

Publications in Math-Net.Ru

1. Questions of decomposition in conveyor computer
   
   Zap. Nauchn. Sem. LOMI, 159 (1987),  47–55
2. A spanning-tree algorithm for constructing streams in pipelines
   
   Zap. Nauchn. Sem. LOMI, 159 (1987),  40–46
3. Maximum number of flows in a pipeline
   
   Zap. Nauchn. Sem. LOMI, 139 (1984),  22–40
4. Finding of “wasp waist” in partial ordering graph
   
   Zap. Nauchn. Sem. LOMI, 124 (1983),  41–43
5. Calculation of lower bound of schedule length
   
   Zap. Nauchn. Sem. LOMI, 124 (1983),  35–40
6. An experiment with parallel processing of computational processes modeled by bilogic graphs
   
   Zap. Nauchn. Sem. LOMI, 111 (1981),  162–176
7. On parallelizing of computations with loops and branchings
   
   Zap. Nauchn. Sem. LOMI, 90 (1979),  210–226
8. Methods and programs for generating random graphs
   
   Zap. Nauchn. Sem. LOMI, 54 (1975),  259–264
9. A survey of scheduling methods for multiprocessor systems
   
   Zap. Nauchn. Sem. LOMI, 54 (1975),  229–258
10. Some algorithm of the construction of the optimal Schedule for parallelsequential networks
    
    Zap. Nauchn. Sem. LOMI, 48 (1974),  200–204
11. Branch and bound method for parallel sequencing problems
    
    Zap. Nauchn. Sem. LOMI, 35 (1973),  146–155
12. Solution of some problems of parallel ordering
    
    Zap. Nauchn. Sem. LOMI, 18 (1970),  16–26
13. On the main conceptions of parallel ordering
    
    Zap. Nauchn. Sem. LOMI, 18 (1970),  6–15
14. A numerical experiment on the calculation of the Hasse invariant for certain curves
    
    Izv. Akad. Nauk SSSR Ser. Mat., 29:5 (1965),  1203–1204