Two lower bounds in asynchronous distributed computation
type: Item
instance of: scholarly article
title: Two lower bounds in asynchronous distributed computation
zbMATH Open document ID: 0731.68043
DOI: 10.1016/0022-0000(91)90002-M
published in: Journal of Computer and System Sciences
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 4209592
zbMATH Keywords: lower bounds
zbMATH Keywords: message complexity
zbMATH Keywords: distributed computation
zbMATH Keywords: bidirectional ring of n anonymous processors
author: Pavol Ďuriš
author: Zvi Galil
MaRDI profile type: Publication
cites work: Computing on an anonymous ring
cites work: Q3769937
cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
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: 0022-0000(91)90002-m
OpenAlex ID: W2148349970
description: scientific article; zbMATH DE number 4209592