Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Distributed election in complete networks (1988)
    Springer
    Distributed computing 3 (1988), S. 19-22 
    Details
    ISSN: 1432-0452
    Keywords: Distributed election algorithms ; Expected message complexity ; Synchronous complete networks ; Asynchronous complete networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and anO(n) expected message complexity is shown.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01788564
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...