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.

The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms

Noga Alon, Yossi Azar. The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms. In 28th Annual Symposium on Foundations of Computer Science, 12-14 October 1987, Los Angeles, California, USA. pages 489-498, IEEE, 1987.

Possibly Related Publications

The following publications are possibly variants of this publication:

runs on