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

Shuji Jimbo; Akira Maruoka

doi:10.1007/3-540-56279-6_69

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

Shuji Jimbo, Akira Maruoka

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 log₂ n and whose depth is O((log n)²). 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 ₂ n + O(n). Moreover, for arbitrary C > 3/log₂ 3 = 1.8927…, we construct (n, n/2)-selectors of size at most Cn log₂n + O(n).

Original language	English
Title of host publication	Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings
Editors	Takao Nishizeki, Toshihide Ibaraki, Kazuo Iwama, Masafurni Yamashita, Yasuyoshi Inagaki
Publisher	Springer Verlag
Pages	165-174
Number of pages	10
ISBN (Print)	9783540562795
DOIs	https://doi.org/10.1007/3-540-56279-6_69
Publication status	Published - 1992
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

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-56279-6_69

Fingerprint 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

Jimbo, S., & Maruoka, A. (1992). Selection networks with 8n log₂n size and O(log n) depth. In T. Nishizeki, T. Ibaraki, K. Iwama, M. Yamashita, & Y. Inagaki (Eds.), Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings (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₂n size and O(log n) depth. / Jimbo, Shuji; Maruoka, Akira.

Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings. ed. / Takao Nishizeki; Toshihide Ibaraki; Kazuo Iwama; Masafurni Yamashita; Yasuyoshi Inagaki. 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 proceeding › Conference contribution

Jimbo, S & Maruoka, A 1992, Selection networks with 8n log₂n size and O(log n) depth. in T Nishizeki, T Ibaraki, K Iwama, M Yamashita & Y Inagaki (eds), Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings. 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

Jimbo S, Maruoka A. Selection networks with 8n log₂n size and O(log n) depth. In Nishizeki T, Ibaraki T, Iwama K, Yamashita M, Inagaki Y, editors, Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings. 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

Jimbo, Shuji ; Maruoka, Akira. / Selection networks with 8n log₂n size and O(log n) depth. Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings. editor / Takao Nishizeki ; Toshihide Ibaraki ; Kazuo Iwama ; Masafurni Yamashita ; Yasuyoshi Inagaki. 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 Jimbo and Akira Maruoka",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1992. Copyright: Copyright 2017 Elsevier B.V., All rights reserved.; 3rd International Symposium on Algorithms and Computation, ISAAC 1992 ; Conference date: 16-12-1992 Through 18-12-1992",

year = "1992",

doi = "10.1007/3-540-56279-6_69",

language = "English",

isbn = "9783540562795",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "165--174",

editor = "Takao Nishizeki and Toshihide Ibaraki and Kazuo Iwama and Masafurni Yamashita and Yasuyoshi Inagaki",

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 - Jimbo, 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

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

A2 - Nishizeki, Takao

A2 - Ibaraki, Toshihide

A2 - Iwama, Kazuo

A2 - Yamashita, Masafurni

A2 - Inagaki, Yasuyoshi

PB - Springer Verlag

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

Y2 - 16 December 1992 through 18 December 1992

ER -