{"title":"在存在错误的情况下进行基于比较的搜索","authors":"Ryan S. Borgstrom, S. R. Kosaraju","doi":"10.1145/167088.167129","DOIUrl":null,"url":null,"abstract":"The classic problem of searching an ordered list becomes more complicated when the answers to queries are not reliable. In the prefix-bounded error model, the number of incorrect responses at no point exceeds r times the number of questions, where r is a fixed positive fraction strictly less than ~. We present efficient algorithms for searching in this error model, and we also establish nontrivial lower bounds for sorting, maxima finding, and related problems.","PeriodicalId":280602,"journal":{"name":"Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"73","resultStr":"{\"title\":\"Comparison-based search in the presence of errors\",\"authors\":\"Ryan S. Borgstrom, S. R. Kosaraju\",\"doi\":\"10.1145/167088.167129\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The classic problem of searching an ordered list becomes more complicated when the answers to queries are not reliable. In the prefix-bounded error model, the number of incorrect responses at no point exceeds r times the number of questions, where r is a fixed positive fraction strictly less than ~. We present efficient algorithms for searching in this error model, and we also establish nontrivial lower bounds for sorting, maxima finding, and related problems.\",\"PeriodicalId\":280602,\"journal\":{\"name\":\"Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"73\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/167088.167129\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/167088.167129","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The classic problem of searching an ordered list becomes more complicated when the answers to queries are not reliable. In the prefix-bounded error model, the number of incorrect responses at no point exceeds r times the number of questions, where r is a fixed positive fraction strictly less than ~. We present efficient algorithms for searching in this error model, and we also establish nontrivial lower bounds for sorting, maxima finding, and related problems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
