External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

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.

Optimal Lower Bounds on the Multiparty Communication Complexity

Pavol Duris, José D. P. Rolim. Optimal Lower Bounds on the Multiparty Communication Complexity. In Ernst W. Mayr, Claude Puech, editors, STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings. Volume 900 of Lecture Notes in Computer Science, pages 350-360, Springer, 1995.

Abstract

Abstract is missing.

runs on