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

Shuji Jinbo, Akira Maruoka

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

1 Citation (Scopus)

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 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
PublisherSpringer Verlag
Pages165-174
Number of pages10
Volume650 LNCS
ISBN (Print)9783540562795
DOIs
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

Other

Other3rd International Symposium on Algorithms and Computation, ISAAC 1992
CountryJapan
CityNagoya
Period12/16/9212/18/92

Fingerprint

Selector
Expander
Classify
Arbitrary
Class

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Jinbo, S., & Maruoka, A. (1992). Selection networks with 8n log2n 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 log2n size and O(log n) depth. / Jinbo, Shuji; Maruoka, Akira.

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); Vol. 650 LNCS).

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

Jinbo, S & Maruoka, A 1992, Selection networks with 8n log2n 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
Jinbo S, Maruoka A. Selection networks with 8n log2n 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
Jinbo, Shuji ; Maruoka, Akira. / Selection networks with 8n log2n size and O(log n) depth. Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings. Vol. 650 LNCS Springer Verlag, 1992. pp. 165-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fc56f9b86e8b46c395517ee7e446e580,
title = "Selection networks with 8n log2n size and O(log n) depth",
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 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).",
author = "Shuji Jinbo and Akira Maruoka",
year = "1992",
doi = "10.1007/3-540-56279-6_69",
language = "English",
isbn = "9783540562795",
volume = "650 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "165--174",
booktitle = "Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings",

}

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

AN - SCOPUS:85029620405

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 -