Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Tushkina, T A
Statistics Math-Net.Ru
Total publications: 14
Scientific articles: 14

Number of views:
This page:96
Abstract pages:2727
Full texts:1953

https://www.mathnet.ru/eng/person38626
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/190676

Publications in Math-Net.Ru Citations
1987
1. K. V. Shakhbazyan, T. A. Tushkina, M. M. Lebedinskii, “Questions of decomposition in conveyor computer”, Zap. Nauchn. Sem. LOMI, 159 (1987),  47–55  mathnet  zmath
2. K. V. Shakhbazyan, T. A. Tushkina, M. M. Lebedinskii, “A spanning-tree algorithm for constructing streams in pipelines”, Zap. Nauchn. Sem. LOMI, 159 (1987),  40–46  mathnet  zmath
1984
3. K. V. Shakhbazyan, T. A. Tushkina, “Maximum number of flows in a pipeline”, Zap. Nauchn. Sem. LOMI, 139 (1984),  22–40  mathnet  mathscinet  zmath; J. Soviet Math., 36:2 (1987), 185–198
1983
4. T. A. Tushkina, “Finding of “wasp waist” in partial ordering graph”, Zap. Nauchn. Sem. LOMI, 124 (1983),  41–43  mathnet  mathscinet  zmath
5. T. A. Tushkina, “Calculation of lower bound of schedule length”, Zap. Nauchn. Sem. LOMI, 124 (1983),  35–40  mathnet  mathscinet  zmath
1981
6. V. S. Sokhranskaya, T. A. Tushkina, “An experiment with parallel processing of computational processes modeled by bilogic graphs”, Zap. Nauchn. Sem. LOMI, 111 (1981),  162–176  mathnet  mathscinet; J. Soviet Math., 24:1 (1984), 107–117
1979
7. V. S. Sokhranskaya, T. A. Tushkina, “On parallelizing of computations with loops and branchings”, Zap. Nauchn. Sem. LOMI, 90 (1979),  210–226  mathnet  mathscinet  zmath; J. Soviet Math., 20:2 (1982), 2055–2067
1975
8. T. A. Tushkina, “Methods and programs for generating random graphs”, Zap. Nauchn. Sem. LOMI, 54 (1975),  259–264  mathnet  mathscinet  zmath; J. Soviet Math., 15:5 (1981), 670–673
9. K. V. Shakhbazyan, T. A. Tushkina, “A survey of scheduling methods for multiprocessor systems”, Zap. Nauchn. Sem. LOMI, 54 (1975),  229–258  mathnet  mathscinet  zmath; J. Soviet Math., 15:5 (1981), 651–669 2
1974
10. K. V. Shakhbazyan, T. A. Tushkina, N. B. Lebedinskaya, “Some algorithm of the construction of the optimal Schedule for parallelsequential networks”, Zap. Nauchn. Sem. LOMI, 48 (1974),  200–204  mathnet  mathscinet  zmath
1973
11. K. V. Shakhbazyan, T. A. Tushkina, “Branch and bound method for parallel sequencing problems”, Zap. Nauchn. Sem. LOMI, 35 (1973),  146–155  mathnet
1970
12. T. A. Tushkina, K. V. Shakhbazyan, “Solution of some problems of parallel ordering”, Zap. Nauchn. Sem. LOMI, 18 (1970),  16–26  mathnet  mathscinet  zmath
13. T. A. Tushkina, K. V. Shakhbazyan, “On the main conceptions of parallel ordering”, Zap. Nauchn. Sem. LOMI, 18 (1970),  6–15  mathnet  mathscinet  zmath
1965
14. T. A. Tushkina, “A numerical experiment on the calculation of the Hasse invariant for certain curves”, Izv. Akad. Nauk SSSR Ser. Mat., 29:5 (1965),  1203–1204  mathnet  mathscinet  zmath
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024