Back to Results
First PageMeta Content
Tree / Connectivity / Adjacency matrix / Graph coloring / Minimum spanning tree / Trapezoid graph / Graph theory / Mathematics / Graph


Acta Univ. Sapientiae, Mathematica, 5, [removed]–82 Leader election in synchronous networks Antal Iv´anyi Faculty of Informatics E¨otv¨os Lor´and University
Add to Reading List

Document Date: 2014-03-04 12:13:44


Open Document

File Size: 338,68 KB

Share Result on Facebook

Country

Hungary / /

Currency

pence / /

/

Facility

Informatics E¨otv¨os Lor´and University / /

IndustryTerm

labeled directed networks / comparison-based algorithms / deterministic algorithms / leader election algorithm / star networks / leader election algorithms / symmetric networks random algorithms / deterministic algorithm / connected networks / synchronous networks / unidirectional networks / breadth-first search tree / deep search trees / distributed systems / /

Organization

Acta Univ. / Antal Iv´anyi Faculty of Informatics E¨otv¨os Lor´and University Budapest / /

Person

Antal Bege / Antal Bege Abstract / /

Position

Professor / labeled directed networks Leader / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

Mathematica / /

ProvinceOrState

Virginia / /

Technology

known leader election algorithm / deterministic algorithm / previous algorithm / deterministic algorithms / symmetric networks random algorithms / LCR algorithm / 2.1 63 LCR algorithm / comparison-based algorithms / leader election algorithms / Hirschberg-Sinclair algorithm / /

SocialTag