Language complexity on the synchronous anonymous ring
type: Item
instance of: scholarly article
title: Language complexity on the synchronous anonymous ring
zbMATH Open document ID: 0643.68120
DOI: 10.1016/0304-3975(87)90062-4
author: Hagit Attiya
author: Yishay Mansour
published in: Theoretical Computer Science
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D60
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 4049113
zbMATH Keywords: distributed networks of processors
zbMATH Keywords: computable function
zbMATH Keywords: counter-free regular languages
zbMATH Keywords: gap theorem
zbMATH Keywords: synchronous anonymous ring
MaRDI profile type: Publication
full work available at URL: 0304-3975(87)90062-4
OpenAlex ID: W2088281739
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: Q5592246
cites work: Q5641083
cites work: An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
cites work: Lower Bounds for Distributed Maximum-Finding Algorithms
description: scientific article; zbMATH DE number 4049113