Exact communication costs for consensus and leader in a tree (Q1827285): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total\(_k\)-diameter of connection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decentralized extrema-finding in circular configurations of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for finding centers and medians in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed network protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on communication complexity in distributed computer networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:55, 6 June 2024

scientific article
Language Label Description Also known as
English
Exact communication costs for consensus and leader in a tree
scientific article

    Statements

    Exact communication costs for consensus and leader in a tree (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    Distributed computing
    0 references
    Consensus
    0 references
    Leader election
    0 references
    Bit complexity
    0 references
    Message
    0 references
    complexity
    0 references
    Communication complexity
    0 references