On the power of synchronization between two adjacent processes

DOI10.1007/S00446-010-0115-3zbMATH Open1231.68167OpenAlexW2171323316MaRDI QIDQ660989FDOQ660989

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

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

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)

Cites Work

• Introduction to Distributed Algorithms
• Computation in networks of passively mobile finite-state sensors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Communicating sequential processes
• Distributed enumeration
• Title not available (Why is that?)
• A complete complexity classification of the role assignment problem
• On the minimal synchronism needed for distributed consensus
• Distributed systems. Principles and paradigms.
• Characterizations of classes of graphs recognizable by local computations
• Locally constrained graph homomorphisms and equitable partitions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Labelings Derived from Models in Distributed Computing
• Foundations of Software Science and Computation Structures
• SOFSEM 2005: Theory and Practice of Computer Science
• A self-stabilizing enumeration algorithm.
• Distributed Systems
• Title not available (Why is that?)
• Concurrent Processes and Their Syntax
• Title not available (Why is that?)

Cited In (7)

• Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
• Election in partially anonymous networks with arbitrary knowledge in message passing systems
• Title not available (Why is that?)
• Locality and checkability in wait-free computing
• Locality and Checkability in Wait-Free Computing
• Title not available (Why is that?)
• SOFSEM 2005: Theory and Practice of Computer Science

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)