### Abstract

An (n, n/2)-selector 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 element in one class is at least as large as all of those in the other. Based on utilization of expanders, Pippenger[6] constructed (n, n/2)-selectors, whose size is asymptotic to 2n log_{2} n and whose depth is O((log n)^{2}). In the same spirit, we obtain a relatively simple method to construct (n, n/2)-seleetors of depth O(log n). We construct (n, n/2)-selectors of size at most 8n log _{2} n + O(n). Moreover, for arbitrary C > 3/log_{2} 3 = 1.8927…, we construct (n, n/2)-selectors of size at most Cn log_{2}n + O(n).

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

Title of host publication | Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings |

Publisher | Springer Verlag |

Pages | 165-174 |

Number of pages | 10 |

Volume | 650 LNCS |

ISBN (Print) | 9783540562795 |

DOIs | |

Publication status | Published - 1992 |

Externally published | Yes |

Event | 3rd International Symposium on Algorithms and Computation, ISAAC 1992 - Nagoya, Japan Duration: Dec 16 1992 → Dec 18 1992 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 650 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 3rd International Symposium on Algorithms and Computation, ISAAC 1992 |
---|---|

Country | Japan |

City | Nagoya |

Period | 12/16/92 → 12/18/92 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

_{2}n size and O(log n) depth. In

*Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings*(Vol. 650 LNCS, pp. 165-174). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 650 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-56279-6_69

**Selection networks with 8n log _{2}n size and O(log n) depth.** / Jinbo, Shuji; Maruoka, Akira.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

_{2}n size and O(log n) depth. in

*Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings.*vol. 650 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 650 LNCS, Springer Verlag, pp. 165-174, 3rd International Symposium on Algorithms and Computation, ISAAC 1992, Nagoya, Japan, 12/16/92. https://doi.org/10.1007/3-540-56279-6_69

_{2}n size and O(log n) depth. In Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings. Vol. 650 LNCS. Springer Verlag. 1992. p. 165-174. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-56279-6_69

}

TY - GEN

T1 - Selection networks with 8n log2n size and O(log n) depth

AU - Jinbo, Shuji

AU - Maruoka, Akira

PY - 1992

Y1 - 1992

N2 - An (n, n/2)-selector 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 element in one class is at least as large as all of those in the other. Based on utilization of expanders, Pippenger[6] constructed (n, n/2)-selectors, whose size is asymptotic to 2n log2 n and whose depth is O((log n)2). In the same spirit, we obtain a relatively simple method to construct (n, n/2)-seleetors of depth O(log n). We construct (n, n/2)-selectors of size at most 8n log 2 n + O(n). Moreover, for arbitrary C > 3/log2 3 = 1.8927…, we construct (n, n/2)-selectors of size at most Cn log2n + O(n).

AB - An (n, n/2)-selector 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 element in one class is at least as large as all of those in the other. Based on utilization of expanders, Pippenger[6] constructed (n, n/2)-selectors, whose size is asymptotic to 2n log2 n and whose depth is O((log n)2). In the same spirit, we obtain a relatively simple method to construct (n, n/2)-seleetors of depth O(log n). We construct (n, n/2)-selectors of size at most 8n log 2 n + O(n). Moreover, for arbitrary C > 3/log2 3 = 1.8927…, we construct (n, n/2)-selectors of size at most Cn log2n + O(n).

UR - http://www.scopus.com/inward/record.url?scp=85029620405&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029620405&partnerID=8YFLogxK

U2 - 10.1007/3-540-56279-6_69

DO - 10.1007/3-540-56279-6_69

M3 - Conference contribution

SN - 9783540562795

VL - 650 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 165

EP - 174

BT - Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings

PB - Springer Verlag

ER -