Private vs. common random bits in communication complexity

Research output: Contribution to journalArticlepeer-review


We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the models are essentially equal.

Original languageEnglish
Pages (from-to)67-71
Number of pages5
JournalInformation Processing Letters
Issue number2
StatePublished - 31 Jul 1991
Externally publishedYes


  • Theory of computation
  • communication complexity
  • randomness

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Private vs. common random bits in communication complexity'. Together they form a unique fingerprint.

Cite this