Symmetry breaking in distributed networks
type: Item
instance of: scholarly article
title: Symmetry breaking in distributed networks
zbMATH Open document ID: 0705.68020
DOI: 10.1016/0890-5401(90)90004-2
author: Alon Itai
author: Michael Rodeh
published in: Information and Computation
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 4157856
zbMATH Keywords: electing a leader
zbMATH Keywords: finding the size of the ring
zbMATH Keywords: distributed networks
MaRDI profile type: Publication
full work available at URL: 0890-5401(90)90004-2
OpenAlex ID: W2054364230
cites work: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
cites work: An improved algorithm for decentralized extrema-finding in circular configurations of processes
cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
cites work: Q3738540
cites work: Decentralized extrema-finding in circular configurations of processors
cites work: Concurrent Processes and Their Syntax
cites work: On the bit complexity of distributed computations in a ring with a leader
cites work: An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
cites work: Probabilistic automata
cites work: The choice coordination problem
cites work: Q3725535
description: scientific article; zbMATH DE number 4157856