On the power of synchronization between two adjacent processes
type: Item
instance of: scholarly article
title: On the power of synchronization between two adjacent processes
zbMATH Open document ID: 1231.68167
author: J. Chalopin
author: Yves Métivier
published in: Distributed Computing
publication date: 2012-02-06T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6003474
zbMATH Keywords: local computations
zbMATH Keywords: labelled edges
zbMATH Keywords: election algorithm
MaRDI profile type: Publication
full work available at URL: s00446-010-0115-3
OpenAlex ID: W2171323316
cites work: Computation in networks of passively mobile finite-state sensors
cites work: Q3396623
cites work: SOFSEM 2005: Theory and Practice of Computer Science
cites work: Foundations of Software Science and Computation Structures
cites work: Q3504346
cites work: Q3416074
cites work: Graph Labelings Derived from Models in Distributed Computing
cites work: On the minimal synchronism needed for distributed consensus
cites work: A complete complexity classification of the role assignment problem
cites work: Locally constrained graph homomorphisms and equitable partitions
cites work: Distributed Systems
cites work: Q4738224
cites work: Characterizations of classes of graphs recognizable by local computations
cites work: A self-stabilizing enumeration algorithm.
cites work: Communicating sequential processes
cites work: Distributed enumeration
cites work: Q4818726
cites work: Concurrent Processes and Their Syntax
cites work: Q4481981
cites work: Q4239067
cites work: Q3619881
cites work: Introduction to Distributed Algorithms
DOI: 10.1007/S00446-010-0115-3
description: scientific article; zbMATH DE number 6003474