| Presentation | 1996/9/17 Lower bound of Merging networks by Computer computation Kazuhisa Masuda, Shigeki Iwata, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Let M(m,n) denote the minimum number of comparators in (m,n)-merging net-works. In the report, we first prove that M(4,5)=12. Then we present that M(4,6)=14, where the proof includes enormous computation by Workstation. By using of the result, we show that M(4,8)=17. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | merging network / computer computation / lower bound / algorithm |
| Paper # | COMP96-29 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1996/9/17(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Lower bound of Merging networks by Computer computation |
| Sub Title (in English) | |
| Keyword(1) | merging network |
| Keyword(2) | computer computation |
| Keyword(3) | lower bound |
| Keyword(4) | algorithm |
| 1st Author's Name | Kazuhisa Masuda |
| 1st Author's Affiliation | Department of Computer Science and Information Mathematics, The University of Electro-Communications() |
| 2nd Author's Name | Shigeki Iwata |
| 2nd Author's Affiliation | Department of Computer Science and Information Mathematics, The University of Electro-Communications |
| Date | 1996/9/17 |
| Paper # | COMP96-29 |
| Volume (vol) | vol.96 |
| Number (no) | 250 |
| Page | pp.pp.- |
| #Pages | 10 |
| Date of Issue | |