The bit complexity of the predecessor problem

Y. Afek, M. Cohen, E. Haalman

Research output: Contribution to journalArticlepeer-review

Abstract

A tight bound of 2n - 1 bits on the communication complexity of the "predecessor" problem in a synchronous ring (previously known as the "last in a synchronous ring" problem) is presented.

Original languageEnglish
Pages (from-to)109-112
Number of pages4
JournalInformation Processing Letters
Volume63
Issue number2
DOIs
StatePublished - 28 Jul 1997

Keywords

  • Anonymous ring
  • Distributed computing
  • Unidirectional

Fingerprint

Dive into the research topics of 'The bit complexity of the predecessor problem'. Together they form a unique fingerprint.

Cite this