scientific article; zbMATH DE number 4050994

MaRDI QIDQ3787484zbMATHFDO

Authors Meinolf Koshors, Rüdiger Reischuk

Publication date 1988

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)

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

Cited in

(4)

• Message Lower Bounds via Efficient Network Synchronization
• Hundreds of impossibility results for distributed computing
• The lower bound of the network connectivity guaranteeing in-phase synchronization
• Message lower bounds via efficient network 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)