RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
Video Library
Archive
Most viewed videos

Search
RSS
New in collection





You may need the following programs to see the files






Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2015
November 11, 2015 12:45, Moscow, Steklov Mathematical Institute of RAS, Conference Hall (8 Gubkina)
 


On the Complexity of Constructing Multiprocessor Little-Preemptive Schedules

E. V. Shchepin

Number of views:
This page:194
Video files:53

E. V. Shchepin
Photo Gallery




References
  1. E. V. Schepin, “O slozhnosti postroeniya mnogoprotsessornykh raspisanii s malym kolichestvom preryvanii”, Sovremennye problemy matematiki, mekhaniki i matematicheskoi fiziki, Sbornik statei, Tr. MIAN, 290, MAIK, M., 2015, 178–190  mathnet  crossref  elib; E. V. Shchepin, “On the Complexity of Constructing Multiprocessor Little-Preemptive Schedules”, Proc. Steklov Inst. Math., 290 (2015), 166–177  crossref  scopus


Related articles:

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017