scientific article; zbMATH DE number 4050994

zbMATH Open0644.68064MaRDI QIDQ3787484FDOQ3787484

Authors: Meinolf Koshors, Rüdiger Reischuk 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Optimal lower bounds for some distributed algorithms for a complete network of processors
• Two lower bounds in asynchronous distributed computation
• scientific article; zbMATH DE number 4062584
• A trade-off between information and communication in broadcast protocols

zbMATH Keywords

local informationmessage complexitydistributed networkelection in synchronous networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Cited In (3)

• Hundreds of impossibility results for distributed computing
• Message Lower Bounds via Efficient Network Synchronization
• The lower bound of the network connectivity guaranteeing in-phase synchronization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787484)