Message Lower Bounds via Efficient Network Synchronization (Q2835018): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: David Peleg / rank
Normal rank
 
Property / author
 
Property / author: David Peleg / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-48314-6_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2547779378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing on Core-Periphery Networks: Axiom-Based Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between information and communication in broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Verification and Hardness of Distributed Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinism vs. Nondeterminism in Multiparty Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of the congested clique model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Optimal Bounds in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computation of Large-scale Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for distributed minimum-weight spanning tree verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds for some distributed algorithms for a complete network of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Universal Leader Election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear bounds for randomized leader election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal deterministic routing and sorting on the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight unconditional lower bound on distributed randomwalk computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading Bit, Message, and Time Complexity of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on communication complexity in distributed computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: When distributed computation is communication expensive / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:30, 13 July 2024

scientific article
Language Label Description Also known as
English
Message Lower Bounds via Efficient Network Synchronization
scientific article

    Statements

    Message Lower Bounds via Efficient Network Synchronization (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2016
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references