Doklady Akademii Nauk SSSR
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

Doklady Akademii Nauk SSSR, 1982, Volume 265, Number 2, Pages 268–274 (Mi dan45427)  
MATHEMATICS

Complexity of parallel algorithms and computations

M. S. Burgin

State Institute design of agricultural machinery plants, Kiev
Full-text PDF (993 kB)
Presented: A. N. Kolmogorov
Received: 09.03.1982
Bibliographic databases:
Document Type: Article
UDC: 51.01:518.5
Language: Russian
Citation: M. S. Burgin, “Complexity of parallel algorithms and computations”, Dokl. Akad. Nauk SSSR, 265:2 (1982), 268–274
Citation in format AMSBIB
\Bibitem{Bur82}
\by M.~S.~Burgin
\paper Complexity of parallel algorithms and computations
\jour Dokl. Akad. Nauk SSSR
\yr 1982
\vol 265
\issue 2
\pages 268--274
\mathnet{http://mi.mathnet.ru/dan45427}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0665308}
\zmath{https://zbmath.org/?q=an:0515.68041}
Linking options:
  • https://www.mathnet.ru/eng/dan45427
  • https://www.mathnet.ru/eng/dan/v265/i2/p268
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025