{"title":"在单个键下搜索两个键表","authors":"J. Munro","doi":"10.1145/28395.28436","DOIUrl":null,"url":null,"abstract":"We present a method for arranging an arbitrary 2-key table as an n by 2 array such that a search can be performed under either key in O(lg2n lglg n) time. This is in sharp contrast with an &OHgr;(√n) lower bound for the problem under a model in which all comparisons must involve the value being searched for.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Searching a two key table under a single key\",\"authors\":\"J. Munro\",\"doi\":\"10.1145/28395.28436\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a method for arranging an arbitrary 2-key table as an n by 2 array such that a search can be performed under either key in O(lg2n lglg n) time. This is in sharp contrast with an &OHgr;(√n) lower bound for the problem under a model in which all comparisons must involve the value being searched for.\",\"PeriodicalId\":161795,\"journal\":{\"name\":\"Proceedings of the nineteenth annual ACM symposium on Theory of computing\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the nineteenth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/28395.28436\",\"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 nineteenth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/28395.28436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present a method for arranging an arbitrary 2-key table as an n by 2 array such that a search can be performed under either key in O(lg2n lglg n) time. This is in sharp contrast with an &OHgr;(√n) lower bound for the problem under a model in which all comparisons must involve the value being searched for.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
