scientific article; zbMATH DE number 4050992

MaRDI QIDQ3787481zbMATH OpenFDO

Authors B. Tampakas, P. G. Spirakis

Publication date 1988

zbMATH Keywords

Archimedean networksdistributed computationlimited asynchronylogical ringmutual exclusionreaders and writerssymmetry breaking problemsynchronous networks

Mathematics Subject Classification ID

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

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)

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

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)