New lower bound techniques for distributed leader finding and other problems on rings of processors
type: Item
instance of: scholarly article
title: New lower bound techniques for distributed leader finding and other problems on rings of processors
zbMATH Open document ID: 0732.68048
DOI: 10.1016/0304-3975(91)90193-6
author: Hans L. Bodlaender
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
full work available at URL: https://dspace.library.uu.nl/handle/1874/16571
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 4211500
zbMATH Keywords: leader election
zbMATH Keywords: asynchronous ring of processors
zbMATH Keywords: distributed algorithm
zbMATH Keywords: lower bound
zbMATH Keywords: randomized algorithms
Wikidata QID: Q59568030
MaRDI profile type: Publication
OpenAlex ID: W2006888470
cites work: The Bit Complexity of Randomized Leader Election on a Ring
cites work: Randomized function evaluation on a ring
cites work: Computing on an anonymous ring
cites work: Q3769937
cites work: A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
cites work: Q3742712
cites work: Q3974855
cites work: Q3852212
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: Q3319762
cites work: Average number of messages for distributed leader-fitting in rings of processors
cites work: A lower bound for probabilistic distributed algorithms
cites work: Lower Bounds for Distributed Maximum-Finding Algorithms
cites work: An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
description: scientific article; zbMATH DE number 4211500