scientific article; zbMATH DE number 4050992

zbMATH Open0644.68062MaRDI QIDQ3787481FDOQ3787481

P. G. Spirakis, B. Tampakas

Publication date: 1988

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

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

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)

Cited In (8)

• Title not available (Why is that?)
• 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
• 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)