Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Peredachi Informatsii, 1990, Volume 26, Issue 2, Pages 87–97 (Mi ppi609)  
Communication-Network Theory and Large System Science

A Simple Stable RMA Algorithm for LAN

V. P. Polesskii
Full-text PDF (1245 kB)
Abstract: Effective and exact upper bounds are proved on the probability of connectedness of a distinguished group of vertices in a random graph. These results generalize previous bounds on the probability of connectedness of all vertices in a graph.
Received: 15.06.1987
Revised: 01.03.1989
Bibliographic databases:
Document Type: Article
UDC: 621.394.74
Language: Russian
Citation: V. P. Polesskii, “A Simple Stable RMA Algorithm for LAN”, Probl. Peredachi Inf., 26:2 (1990), 87–97; Problems Inform. Transmission, 26:2 (1990), 161–169
Citation in format AMSBIB
\Bibitem{Pol90}
\by V.~P.~Polesskii
\paper A~Simple Stable~RMA Algorithm for~LAN
\jour Probl. Peredachi Inf.
\yr 1990
\vol 26
\issue 2
\pages 87--97
\mathnet{http://mi.mathnet.ru/ppi609}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1074130}
\zmath{https://zbmath.org/?q=an:0711.60012}
\transl
\jour Problems Inform. Transmission
\yr 1990
\vol 26
\issue 2
\pages 161--169
Linking options:
  • https://www.mathnet.ru/eng/ppi609
  • https://www.mathnet.ru/eng/ppi/v26/i2/p87
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024