On the power of synchronization between two adjacent processes

DOI10.1007/S00446-010-0115-3MaRDI QIDQ660989zbMATH OpenOpenAlexFDO

Authors J. Chalopin, Yves Métivier

Publication date 6 February 2012

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-010-0115-3

zbMATH Keywords

local computationselection algorithmlabelled edges

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 2087429
• Graph Transformations
• Local computations in graphs: the case of cellular edge local computations

Cites work

• scientific article; zbMATH DE number 5605125 (Why is no real title available?)
• scientific article; zbMATH DE number 5286867 (Why is no real title available?)
• scientific article; zbMATH DE number 1277120 (Why is no real title available?)
• scientific article; zbMATH DE number 3005477 (Why is no real title available?)
• scientific article; zbMATH DE number 2087429 (Why is no real title available?)
• scientific article; zbMATH DE number 2104616 (Why is no real title available?)
• A complete complexity classification of the role assignment problem
• A self-stabilizing enumeration algorithm.
• Characterizations of classes of graphs recognizable by local computations
• Communicating sequential processes
• Computation in networks of passively mobile finite-state sensors
• Concurrent Processes and Their Syntax
• Distributed Systems
• Distributed enumeration
• Distributed systems. Principles and paradigms.
• Foundations of Software Science and Computation Structures
• Graph Labelings Derived from Models in Distributed Computing
• Introduction to Distributed Algorithms
• Local computations in graphs: the case of cellular edge local computations
• Locally constrained graph homomorphisms and equitable partitions
• On the minimal synchronism needed for distributed consensus
• SOFSEM 2005: Theory and Practice of Computer Science

Cited in

(8)

• Election in partially anonymous networks with arbitrary knowledge in message passing systems
• scientific article; zbMATH DE number 2087429 (Why is no real title available?)
• Locality and checkability in wait-free computing
• scientific article; zbMATH DE number 3854402 (Why is no real title available?)
• SOFSEM 2005: Theory and Practice of Computer Science
• Locality and checkability in wait-free computing
• Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
• Mathematical Foundations of Computer Science 2005

This page was built for publication: On the power of synchronization between two adjacent processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q660989)