On the bit complexity of distributed computations in a ring with a leader

Y. Mansour, S. Zaks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study the bit complexity of pattern recognition in a distributed ring with a leader. Each processor gets as input a letter from some alphabet, and these concatenated letters, starting at the leader, form the pattern of the ring. The leader initiates an algorithm that accepts or rejects this pattern. Thus each algorithm recognizes a language over a given alphabet. We prove the following (n is the size of the ring, not known a priori to any of the processors): (1) A language is recognized by an algorithm that uses O(n) bits if and only if it is regular. (2) Every non-regular language requires at least Ω(n logn) bits for its recognition (clearly, every language requires no more than O(n2) bits for its recognition). (3) For every function g(n), Ω.(n logn)≤g(n)≤O(n2), there is a language that requires Θ(g(n)) bits for its recognition.

Original languageEnglish
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages151-160
Number of pages10
ISBN (Electronic)0897911989
DOIs
StatePublished - 1 Nov 1986
Externally publishedYes
Event5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986 - Calgary, Canada
Duration: 11 Aug 198613 Aug 1986

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986
Country/TerritoryCanada
CityCalgary
Period11/08/8613/08/86

Fingerprint

Dive into the research topics of 'On the bit complexity of distributed computations in a ring with a leader'. Together they form a unique fingerprint.

Cite this