IEICE TRANSACTIONS on Information
Minimum Number of Comparators in (6,6)-Merging Network
Summary :
The minimum number of comparators in a (6,6)-merging network is shown to be 17. The number has been known to be either 16 or 17 [See Knuth, The Art of Computer Programming Vol. 3: Sorting and Searching, p. 230]. Minimum numbers for (n,n)-merging netwerks, 1
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.2 pp.137-141
- Publication Date
- 2000/02/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Theory/Models of Computation
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Koichi YAMAZAKI, Hibiki MIZUNO, Kazuhisa MASUDA, Shigeki IWATA, "Minimum Number of Comparators in (6,6)-Merging Network" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 2, pp. 137-141, February 2000, doi: .
Abstract: The minimum number of comparators in a (6,6)-merging network is shown to be 17. The number has been known to be either 16 or 17 [See Knuth, The Art of Computer Programming Vol. 3: Sorting and Searching, p. 230]. Minimum numbers for (n,n)-merging netwerks, 1
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_2_137/_p
Copy
@ARTICLE{e83-d_2_137,
author={Koichi YAMAZAKI, Hibiki MIZUNO, Kazuhisa MASUDA, Shigeki IWATA, },
journal={IEICE TRANSACTIONS on Information},
title={Minimum Number of Comparators in (6,6)-Merging Network},
year={2000},
volume={E83-D},
number={2},
pages={137-141},
abstract={The minimum number of comparators in a (6,6)-merging network is shown to be 17. The number has been known to be either 16 or 17 [See Knuth, The Art of Computer Programming Vol. 3: Sorting and Searching, p. 230]. Minimum numbers for (n,n)-merging netwerks, 1
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Minimum Number of Comparators in (6,6)-Merging Network
T2 - IEICE TRANSACTIONS on Information
SP - 137
EP - 141
AU - Koichi YAMAZAKI
AU - Hibiki MIZUNO
AU - Kazuhisa MASUDA
AU - Shigeki IWATA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2000
AB - The minimum number of comparators in a (6,6)-merging network is shown to be 17. The number has been known to be either 16 or 17 [See Knuth, The Art of Computer Programming Vol. 3: Sorting and Searching, p. 230]. Minimum numbers for (n,n)-merging netwerks, 1
ER -
English
