Bit-optimal election in synchronous rings
type: Item
instance of: scholarly article
title: Bit-optimal election in synchronous rings
zbMATH Open document ID: 0703.68016
DOI: 10.1016/0020-0190(90)90187-3
author: Hans L. Bodlaender
author: Gerard Tel
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
full work available at URL: https://dspace.library.uu.nl/handle/1874/16592
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4153860
zbMATH Keywords: bit optimal election
zbMATH Keywords: analysis and complexity of algorithms
zbMATH Keywords: synchronous rings
Wikidata QID: Q59568052
MaRDI profile type: Publication
OpenAlex ID: W2013480356
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: Electing a leader in a synchronous ring
cites work: Time vs bits
cites work: Lower Bounds for Distributed Maximum-Finding Algorithms
cites work: An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
cites work: Q3933743
DBLP publication ID: journals/ipl/BodlaenderT90
Recommended article: Q3787479
Recommended article: Improved bounds for electing a leader in a synchronous ring
Recommended article: Towards optimal distributed election on chordal rings
Recommended article: Q4035677
Recommended article: Time vs bits
Recommended article: Sorting and election in anonymous asynchronous rings.
Recommended article: The Bit Complexity of Randomized Leader Election on a Ring
Recommended article: Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
Recommended article: Asymptotically optimal election on weighted rings
description: scientific article; zbMATH DE number 4153860