Randomized function evaluation on a ring
type: Item
instance of: scholarly article
title: Randomized function evaluation on a ring
zbMATH Open document ID: 0703.68057
DOI: 10.1007/BF01784021
author: Elsie Sterbin Gottlieb
published in: Distributed Computing
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 4153887
zbMATH Keywords: randomization
zbMATH Keywords: nondeterminism
zbMATH Keywords: asynchrony
zbMATH Keywords: distributed algorithms
zbMATH Keywords: lower bounds
zbMATH Keywords: communication complexity
MaRDI profile type: Publication
cites work: Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
cites work: The Bit Complexity of Randomized Leader Election on a Ring
cites work: Computing on an anonymous ring
cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
cites work: Symmetry breaking in distributed networks
cites work: Q5804241
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
full work available at URL: https://doi.org/10.1007/bf01784021
OpenAlex ID: W2918030272
description: scientific article; zbMATH DE number 4153887