A communication-randomness tradeoff for two-processor systems
From MaRDI portal
Publication:1891144
DOI10.1006/inco.1995.1011zbMath0828.68088OpenAlexW2084812535MaRDI QIDQ1891144
Kurt Mehlhorn, Rudolf Fleischer, Hermann Jung
Publication date: 28 May 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1011
Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication theory (94A05)
Related Items (1)
This page was built for publication: A communication-randomness tradeoff for two-processor systems
