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

Shuji Jimbo, Akira Maruoka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


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).

Original languageEnglish
Title of host publicationAlgorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings
EditorsTakao Nishizeki, Toshihide Ibaraki, Kazuo Iwama, Masafurni Yamashita, Yasuyoshi Inagaki
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540562795
Publication statusPublished - 1992
Externally publishedYes
Event3rd International Symposium on Algorithms and Computation, ISAAC 1992 - Nagoya, Japan
Duration: Dec 16 1992Dec 18 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume650 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other3rd International Symposium on Algorithms and Computation, ISAAC 1992

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Selection networks with 8n log<sub>2</sub>n size and O(log n) depth'. Together they form a unique fingerprint.

Cite this