{"title":"An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File","authors":"V. Pratt","doi":"10.1007/978-1-4684-2001-2_11","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":386860,"journal":{"name":"Complexity of Computer Computations","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity of Computer Computations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-1-4684-2001-2_11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
