# On Probabilistic Networks for Selection, Merging, and Sorting

@article{Leighton1995OnPN, title={On Probabilistic Networks for Selection, Merging, and Sorting}, author={Frank Thomson Leighton and Yuan Ma and Torsten Suel}, journal={Theory of Computing Systems}, year={1995}, volume={30}, pages={559-582} }

- Published 1995 in Theory of Computing Systems
DOI:10.1007/s002240000068

We study comparator networks for selection, merging, and sorting that output the correct result with high probability, given a random input permutation. We prove tight bounds, up to constant factors, on the size and depth of probabilistic (n,k)-selection networks. In the case of (n, n/2)-selection, our result gives a somewhat surprising bound of $\Theta(n \log \log n)$ on the size of networks of success probability in $[\delta, 1-1/\mbox{poly}(n)]$ , where δ is an arbitrarily small positive… CONTINUE READING

#### From This Paper

##### Figures, tables, results, connections, and topics extracted from this paper.

1 Extracted Citations

8 Extracted References

Similar Papers

#### Citing Papers

##### Publications influenced by this paper.

#### Referenced Papers

##### Publications referenced by this paper.

Showing 1-8 of 8 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential