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.

A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms

Jan K. Pachl, Ephraim Korach, Doron Rotem. A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, 5-7 May 1982, San Francisco, California, USA. pages 378-382, ACM, 1982.

Abstract

Abstract is missing.

runs on