立方体排序:可行并行计算机的最优排序算法

{"title":"立方体排序:可行并行计算机的最优排序算法","authors":"R. Cypher, J. Sanz","doi":"10.1007/BFb0040412","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers\",\"authors\":\"R. Cypher, J. Sanz\",\"doi\":\"10.1007/BFb0040412\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":340382,\"journal\":{\"name\":\"Aegean Workshop on Computing\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Aegean Workshop on Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/BFb0040412\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aegean Workshop on Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BFb0040412","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}