Thumbnail
Access Restriction
Subscribed

Author Miltersen, Peter Bro ♦ Paterson, Mike ♦ Tarui, Jun
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1996
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Comparator network ♦ Merging ♦ Sorting
Abstract Let <?Pub Fmt italic>M(m,n)<?Pub Fmt /italic> be the minimum number of comparatorsneeded in a comparator network that merges <?Pub Fmt italic>m<?Pub Fmt /italic> elements x1≤x2≤&cdots;≤xm Our proof technique extends to give similarily tight lower bounds for the size of monotone Boolean circuits for merging, and for the size of switching networks capable of realizing the set of permutations that arise from merging.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1996-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 43
Issue Number 1
Page Count 19
Starting Page 147
Ending Page 165


Open content in new tab

   Open content in new tab
Source: ACM Digital Library