scientific article; zbMATH DE number 176511

MaRDI QIDQ4035677zbMATH OpenFDO

Authors Bernd Schmeltz

Publication date 18 May 1993

zbMATH Keywords

lower boundsleader electionbit complexityrings of processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Recommendations

• Improved bounds for electing a leader in a synchronous ring
• Bit-optimal election in synchronous rings
• The Bit Complexity of Randomized Leader Election on a Ring
• Electing a leader in a synchronous ring
• Structural Information and Communication Complexity

Cited in

(10)

• Bit-optimal election in synchronous rings
• On the microscopic view of time and messages
• Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
• Tight bounds for synchronous communication of information using bits and silence
• Two absolute bounds for distributed bit complexity
• Trading bit, message, and time complexity of distributed algorithms
• Structural Information and Communication Complexity
• Learning a ring cheaply and fast
• scientific article; zbMATH DE number 2113969 (Why is no real title available?)
• On the bit complexity of distributed computations in a ring with a leader

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