Selection Networks

@inproceedings{Pippenger1990SelectionN,
  title={Selection Networks},
  author={Nicholas Pippenger},
  booktitle={SIGAL International Symposium on Algorithms},
  year={1990}
}
An upper bound asymptotic to 2n log n is established for the number of comparators required in a network that classifies n values into two classes, each containing n/2 values, with each value in one class less than or equal to each value in the other. (The best lower bound known for this problem is asymptotic to (n/2) log2 n.) Key words, comparator, classifier, expanding graph, random walk AMS(MOS) subject classifications. 68E05, 94C10 

From This Paper

Topics from this paper.
5 Citations
1 References
Similar Papers

References

Publications referenced by this paper.

BASSALYGO, Asymptotically Optimal Switching Circuits, Problems

  • B L.A.
  • Inform. Transmission,
  • 1981

Similar Papers

Loading similar papers…