The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels

{"title":"The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels","authors":"C. Martel, T. P. Vayda","doi":"10.1007/BFb0040407","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":340382,"journal":{"name":"Aegean Workshop on Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aegean Workshop on Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BFb0040407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}