scientific article; zbMATH DE number 1759418

zbMATH Open0996.68501MaRDI QIDQ4536367FDOQ4536367

Stefan Dobrev

Publication date: 4 November 2002

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cited In (3)

• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
• Communication-efficient leader election and consensus with limited link synchrony

   Recommendations

• Leader election in complete networks 👍 👎
• Leader Election in Complete Networks 👍 👎
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks 👍 👎
• Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\) 👍 👎
• Efficient leader election using sense of direction 👍 👎

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 Q4536367)