Sorting in one round
Given an ordered set of n elements whose order is not known to us, it is shown that by making slightly more than cn 3/2 simultaneous comparison almost all comparisons can be deduced by direct implications. It is also shown that this result is essentially best possible, and that if n is large, almost any choice of cn 3/2 comparisons will yield almost all comparisons by direct implications. © 1981 The Weizmann Science Press of Israel.
Israel Journal of Mathematics
Bollobás, B., & Rosenfeld, M. (1981). Sorting in one round. Israel Journal of Mathematics, 38 (1-2), 154-160. https://doi.org/10.1007/BF02761857