Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Martin Dietzfelbinger. The Linear-Array Problem in Communication Complexity Resolved. Electronic Colloquium on Computational Complexity (ECCC), 3(63), 1996. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The Linear-Array Problem in Communication Complexity ResolvedMartin Dietzfelbinger. stoc 1997: 373-382 [doi]
The following publications are possibly variants of this publication: