{"title":"具有二叉比较代价的二叉搜索树","authors":"T. Ottmann, A. Rosenberg, H. Six, D. Wood","doi":"10.1007/BF00978710","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":250718,"journal":{"name":"International Journal of Computer & Information Sciences","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Binary search trees with binary comparison cost\",\"authors\":\"T. Ottmann, A. Rosenberg, H. Six, D. Wood\",\"doi\":\"10.1007/BF00978710\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":250718,\"journal\":{\"name\":\"International Journal of Computer & Information Sciences\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer & Information Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/BF00978710\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer & Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BF00978710","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}