scientific article; zbMATH DE number 4050992

MaRDI QIDQ3787481zbMATH OpenFDO

Authors B. Tampakas, P. G. Spirakis

Publication date 1988

zbMATH Keywords

mutual exclusiondistributed computationsynchronous networksArchimedean networkslimited asynchronylogical ringreaders and writerssymmetry breaking problem

Mathematics Subject Classification ID

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

Recommendations

• Efficient asynchronous distributed symmetry breaking
• Symmetry breaking in distributed networks
• scientific article; zbMATH DE number 3967924
• Time-Adaptive Algorithms for Synchronization
• Efficiency of semisynchronous versus asynchronous networks

Cited in

(9)

• scientific article; zbMATH DE number 7561283 (Why is no real title available?)
• Constant space and non-constant time in distributed computing
• Fast distributed algorithms to make mutually coordinated decisions in stringent real time
• Time vs bits
• New classes of distributed time complexity
• Efficient asynchronous distributed symmetry breaking
• A derivation of distributed implementation of Warshall's algorithm
• Distributed protocols against mobile eavesdroppers
• Efficient distributed algorithms by using the archimedean time assumption

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