RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Dokl. Akad. Nauk SSSR, 1970, Volume 191, Number 5, Pages 967–970 (Mi dan35329)  

This article is cited in 1 scientific paper (total in 1 paper)

MATHEMATICS

Frequency solution of algorithmically unsolvable queueing problems

J. M. Barzdiņš

University of Latvia, Computing Center, Riga

Full text: PDF file (662 kB)

Bibliographic databases:
UDC: 51.01:518.5
Presented: П. С. Новиков
Received: 04.09.1969

Citation: J. M. Barzdiņš, “Frequency solution of algorithmically unsolvable queueing problems”, Dokl. Akad. Nauk SSSR, 191:5 (1970), 967–970

Citation in format AMSBIB
\Bibitem{Bar70}
\by J.~M.~Barzdi{\c n}{\v s}
\paper Frequency solution of algorithmically unsolvable queueing problems
\jour Dokl. Akad. Nauk SSSR
\yr 1970
\vol 191
\issue 5
\pages 967--970
\mathnet{http://mi.mathnet.ru/dan35329}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=0266751}
\zmath{https://zbmath.org/?q=an:0214.01803}


Linking options:
  • http://mi.mathnet.ru/eng/dan35329
  • http://mi.mathnet.ru/eng/dan/v191/i5/p967

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. K. Zvonkin, L. A. Levin, “The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms”, Russian Math. Surveys, 25:6 (1970), 83–124  mathnet  crossref  mathscinet  zmath
  • Number of views:
    This page:56
    Full text:34

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020