{"title":"Improving the bounds on optimal merging","authors":"C. Christen","doi":"10.1109/SFCS.1978.20","DOIUrl":null,"url":null,"abstract":"This paper presents a new merging algorithm and uses a counterstrategy argument to derive new upper and lower bounds on the complexity of the optimal merging problem. These improved bounds differ by at most ⌈ m/4 ⌉ comparisons, where m is the number of elements of the shorter sequence.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1978.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19
Abstract
This paper presents a new merging algorithm and uses a counterstrategy argument to derive new upper and lower bounds on the complexity of the optimal merging problem. These improved bounds differ by at most ⌈ m/4 ⌉ comparisons, where m is the number of elements of the shorter sequence.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
