### Abstract

A classifier with n inputs is a comparator network that classifies a set of n values into two classes with the same number of values in such a way that each value in one class is at least as large as all of those in the other. Based on the utilization of expanders, Pippenger constructed classifiers with n inputs whose size is asymptotic to 2n log_{2} n. In the same spirit, we obtain a relatively simple method of constructing classifiers of depth O(log n). Consequently, for an arbitrary constant C > 3/log_{2} 3 = 1.8927 . . ., we construct classifiers of depth O(log n) and of size at most Cn log_{2} n + O(n).

Original language | English |
---|---|

Pages (from-to) | 709-739 |

Number of pages | 31 |

Journal | SIAM Journal on Computing |

Volume | 25 |

Issue number | 4 |

DOIs | |

Publication status | Published - Aug 1996 |

Externally published | Yes |

### Keywords

- Classifier
- Comparator network
- Expander
- Selection network

### ASJC Scopus subject areas

- Computer Science(all)
- Mathematics(all)

## Fingerprint Dive into the research topics of 'A method of constructing selection networks with O(log n) depth'. Together they form a unique fingerprint.

## Cite this

Jimbo, S., & Maruoka, A. (1996). A method of constructing selection networks with O(log n) depth.

*SIAM Journal on Computing*,*25*(4), 709-739. https://doi.org/10.1137/S0097539793248329