Communication-Space Tradeoffs for Unrestricted Protocols
From MaRDI portal
Publication:4302289
DOI10.1137/S0097539791196883zbMath0809.68078MaRDI QIDQ4302289
Martin Tompa, P. Y. Yan, P. W. Beame
Publication date: 14 August 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
communication complexity; universal family of hash functions; communicating Boolean branching programs; communicating branching programs
DB lookup for MSC labels failed
Related Items