Journal ArticleOPEN ACCESS

Leader election in synchronous networks

  • Iványi A
Acta Universitatis Sapientiae, Mathematica (2013) 5(1) 54-1
DOI: 10.2478/ausm-2014-0005
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Worst, best and average number of messages and running time of leader election algorithms of different distributed systems are analyzed. Among others the known characterizations of the expected number of messages for LCR algorithm and of the worst number of messages of Hirschberg-Sinclair algorithm are improved

Cite

CITATION STYLE

APA

Iványi, A. (2013). Leader election in synchronous networks. Acta Universitatis Sapientiae, Mathematica, 5(1), 54–1. https://doi.org/10.2478/ausm-2014-0005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free