Rounds in Communication Complexity Revisited
From MaRDI portal
Publication:4037694
DOI10.1137/0222016zbMath0767.68066MaRDI QIDQ4037694
Publication date: 16 May 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222016
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
94C99: Circuits, networks
94A17: Measures of information, entropy
94A05: Communication theory
Related Items
The communication complexity of pointer chasing, One-way multiparty communication lower bound for pointer jumping with applications, Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance, Reversal complexity revisited, On data structures and asymmetric communication complexity, Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs, Lower bounds for one-way probabilistic communication complexity and their application to space complexity, Privacy in non-private environments, The Hardness of Median in the Synchronized Bit Communication Model, Trading Bit, Message, and Time Complexity of Distributed Algorithms