On the bit complexity of distributed computations in a ring with a leader
type: Item
instance of: scholarly article
title: On the bit complexity of distributed computations in a ring with a leader
zbMATH Open document ID: 0636.68038
DOI: 10.1016/0890-5401(87)90056-3
published in: Information and Computation
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68N99
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4037191
zbMATH Keywords: network of processors
zbMATH Keywords: communication complexity
zbMATH Keywords: bit complexity
zbMATH Keywords: pattern recognition
zbMATH Keywords: distributed ring with a leader
author: Yishay Mansour
author: Shmuel Zaks
MaRDI profile type: Publication
full work available at URL: 0890-5401(87)90056-3
OpenAlex ID: W1979286404
cites work: Two lower bounds in asynchronous distributed computation
cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
cites work: Q3883524
cites work: Computational Complexity of One-Tape Turing Machine Computations
cites work: One-tape, off-line Turing machine computations
cites work: Q3862379
cites work: Lower Bounds for Distributed Maximum-Finding Algorithms
cites work: Q5599173
Recommended article: The Bit Complexity of Randomized Leader Election on a Ring
Recommended article: New lower bound techniques for distributed leader finding and other problems on rings of processors
Recommended article: The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
Recommended article: Q3974855
Recommended article: A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
Recommended article: Q4035677
Recommended article: Two absolute bounds for distributed bit complexity
Recommended article: Structural Information and Communication Complexity
Recommended article: Improved bounds for electing a leader in a synchronous ring
Recommended article: The bit complexity of distributed sorting
description: scientific article; zbMATH DE number 4037191