{"id":"https://openalex.org/W4417282047","doi":"https://doi.org/10.1109/pimrc62392.2025.11275340","title":"Communication-Efficient Distributed Computing Through Combinatorial Multi-Access Models","display_name":"Communication-Efficient Distributed Computing Through Combinatorial Multi-Access Models","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4417282047","doi":"https://doi.org/10.1109/pimrc62392.2025.11275340"},"language":null,"primary_location":{"id":"doi:10.1109/pimrc62392.2025.11275340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc62392.2025.11275340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 36th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022319079","display_name":"Shanuja Sasi","orcid":"https://orcid.org/0009-0007-9081-2975"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Shanuja Sasi","raw_affiliation_strings":["Linköping University,Information Theory and Security Laboratory (ITSL),Sweden"],"affiliations":[{"raw_affiliation_string":"Linköping University,Information Theory and Security Laboratory (ITSL),Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016620064","display_name":"Onur G\u00fcnl\u00fc","orcid":"https://orcid.org/0000-0002-0313-7788"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Onur G\u00fcnl\u00fc","raw_affiliation_strings":["Linköping University,Information Theory and Security Laboratory (ITSL),Sweden"],"affiliations":[{"raw_affiliation_string":"Linköping University,Information Theory and Security Laboratory (ITSL),Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022319079"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22190352,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2957000136375427,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2957000136375427,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.22599999606609344,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.09629999846220016,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reducer","display_name":"Reducer","score":0.8432999849319458},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5382999777793884},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5306000113487244},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45350000262260437},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.44929999113082886},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.4490000009536743},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.44679999351501465},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4462999999523163}],"concepts":[{"id":"https://openalex.org/C2776985865","wikidata":"https://www.wikidata.org/wiki/Q26820931","display_name":"Reducer","level":2,"score":0.8432999849319458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8330000042915344},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7174000144004822},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5382999777793884},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5306000113487244},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45350000262260437},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.44929999113082886},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.4490000009536743},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.44679999351501465},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4462999999523163},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.39730000495910645},{"id":"https://openalex.org/C70061542","wikidata":"https://www.wikidata.org/wiki/Q989016","display_name":"Distributed database","level":2,"score":0.3815000057220459},{"id":"https://openalex.org/C3739613","wikidata":"https://www.wikidata.org/wiki/Q679003","display_name":"Distributed Computing Environment","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36910000443458557},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3425999879837036},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C42112101","wikidata":"https://www.wikidata.org/wiki/Q5283146","display_name":"Distributed design patterns","level":3,"score":0.30329999327659607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28859999775886536},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.27480000257492065},{"id":"https://openalex.org/C557945733","wikidata":"https://www.wikidata.org/wiki/Q389772","display_name":"Data transmission","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26510000228881836},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.2630999982357025}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pimrc62392.2025.11275340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc62392.2025.11275340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 36th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W2169897889","https://openalex.org/W2173213060","https://openalex.org/W2589571058","https://openalex.org/W2757498728","https://openalex.org/W2808580034","https://openalex.org/W2910542348","https://openalex.org/W2953445722","https://openalex.org/W2964120628","https://openalex.org/W2964143317","https://openalex.org/W2964333472","https://openalex.org/W2987490938","https://openalex.org/W2989813225","https://openalex.org/W3111074267","https://openalex.org/W3172611738","https://openalex.org/W3212438203","https://openalex.org/W4251007617","https://openalex.org/W4386057540","https://openalex.org/W4392405750","https://openalex.org/W4401692859","https://openalex.org/W4401693622","https://openalex.org/W4403182673","https://openalex.org/W4410341047","https://openalex.org/W4415368491"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"explores":[2],"the":[3,74,80,87,97,109],"multi-access":[4],"distributed":[5,11],"computing":[6,12],"(MADC)":[7],"model,":[8],"a":[9,43,58,65],"novel":[10],"framework":[13],"where":[14],"mapper":[15,39],"and":[16,69,78],"reducer":[17,90,100],"nodes":[18,101],"are":[19],"distinct":[20],"entities.":[21],"Unlike":[22],"traditional":[23],"MapReduce":[24,70],"frameworks,":[25],"MADC":[26],"leverages":[27],"coding-theoretic":[28],"techniques":[29],"to":[30,51,103],"minimize":[31],"communication":[32,76,113],"overhead":[33],"without":[34],"necessitating":[35],"file":[36],"replication":[37],"across":[38],"nodes.":[40,91],"We":[41],"introduce":[42],"new":[44],"approach":[45],"utilizing":[46],"combinatorial":[47,105],"designs,":[48],"specifically":[49],"t-designs,":[50],"construct":[52],"efficient":[53],"coding":[54],"schemes":[55],"that":[56],"achieve":[57],"computation":[59],"load":[60],"of":[61,82,89,99,111],"1.":[62],"By":[63],"establishing":[64],"connection":[66],"between":[67],"t-designs":[68],"Arrays,":[71],"we":[72],"characterize":[73],"achievable":[75],"loads":[77],"demonstrate":[79],"flexibility":[81],"our":[83],"method":[84],"in":[85],"selecting":[86],"number":[88,98],"The":[92],"proposed":[93],"scheme":[94],"significantly":[95],"reduces":[96],"relative":[102],"existing":[104],"topology":[106],"schemes,":[107],"at":[108],"expense":[110],"increased":[112],"cost.":[114]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-12-12T00:00:00"}