{"id":"https://openalex.org/W3080363640","doi":"https://doi.org/10.1109/isit44484.2020.9174542","title":"Bivariate Polynomial Coding for Straggler Exploitation with Heterogeneous Workers","display_name":"Bivariate Polynomial Coding for Straggler Exploitation with Heterogeneous Workers","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3080363640","doi":"https://doi.org/10.1109/isit44484.2020.9174542","mag":"3080363640"},"language":"en","primary_location":{"id":"doi:10.1109/isit44484.2020.9174542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11380/1247344","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050333110","display_name":"Burak Has\u0131rc\u0131oglu","orcid":"https://orcid.org/0000-0001-5005-2894"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Burak Has\u0131rc\u0131o\u011flu","raw_affiliation_strings":["Imperial College London,UK","Imperial College London, UK"],"affiliations":[{"raw_affiliation_string":"Imperial College London,UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Imperial College London, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038872773","display_name":"Jes\u00fas G\u00f3mez-Vilardeb\u00f3","orcid":"https://orcid.org/0000-0002-3162-8058"},"institutions":[{"id":"https://openalex.org/I4210087295","display_name":"Centre Tecnologic de Telecomunicacions de Catalunya","ror":"https://ror.org/001cwea56","country_code":"ES","type":"nonprofit","lineage":["https://openalex.org/I4210087295","https://openalex.org/I4387153040"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Jes\u00fas G\u00f3mez-Vilardeb\u00f3","raw_affiliation_strings":["Centre Tecnològic de Telecomunicacions de Catalunya (CTTC/CERCA),Barcelona,Spain","Centre Tecnol\u00f2gic de Telecomunicacions de Catalunya (CTTC/CERCA), Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Centre Tecnològic de Telecomunicacions de Catalunya (CTTC/CERCA),Barcelona,Spain","institution_ids":["https://openalex.org/I4210087295"]},{"raw_affiliation_string":"Centre Tecnol\u00f2gic de Telecomunicacions de Catalunya (CTTC/CERCA), Barcelona, Spain","institution_ids":["https://openalex.org/I4210087295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016883501","display_name":"Den\u0131z G\u00fcnd\u00fcz","orcid":"https://orcid.org/0000-0002-7725-395X"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Deniz G\u00fcnd\u00fcz","raw_affiliation_strings":["Imperial College London,UK","Imperial College London, UK"],"affiliations":[{"raw_affiliation_string":"Imperial College London,UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Imperial College London, UK","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050333110"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":1.3721,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85402003,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"251","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9995999932289124,"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.9995999932289124,"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/T10237","display_name":"Cryptography and Data Security","score":0.9987999796867371,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bivariate-analysis","display_name":"Bivariate analysis","score":0.6874308586120605},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.6244509816169739},{"id":"https://openalex.org/keywords/univariate","display_name":"Univariate","score":0.6029694676399231},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5878920555114746},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5785272121429443},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5449615120887756},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.518286406993866},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4489884376525879},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42816218733787537},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.42003610730171204},{"id":"https://openalex.org/keywords/polynomial-matrix","display_name":"Polynomial matrix","score":0.4181123375892639},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3510133922100067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32423165440559387},{"id":"https://openalex.org/keywords/matrix-polynomial","display_name":"Matrix polynomial","score":0.24208715558052063},{"id":"https://openalex.org/keywords/multivariate-statistics","display_name":"Multivariate statistics","score":0.11894997954368591},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09211203455924988}],"concepts":[{"id":"https://openalex.org/C64341305","wikidata":"https://www.wikidata.org/wiki/Q4919225","display_name":"Bivariate analysis","level":2,"score":0.6874308586120605},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.6244509816169739},{"id":"https://openalex.org/C199163554","wikidata":"https://www.wikidata.org/wiki/Q1681619","display_name":"Univariate","level":3,"score":0.6029694676399231},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5878920555114746},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5785272121429443},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5449615120887756},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.518286406993866},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4489884376525879},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42816218733787537},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.42003610730171204},{"id":"https://openalex.org/C126352355","wikidata":"https://www.wikidata.org/wiki/Q2562273","display_name":"Polynomial matrix","level":4,"score":0.4181123375892639},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3510133922100067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32423165440559387},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.24208715558052063},{"id":"https://openalex.org/C161584116","wikidata":"https://www.wikidata.org/wiki/Q1952580","display_name":"Multivariate statistics","level":2,"score":0.11894997954368591},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09211203455924988},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit44484.2020.9174542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.unimore.it:11380/1247344","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1247344","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:iris.unimore.it:11380/1247344","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1247344","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W306248719","https://openalex.org/W2268702383","https://openalex.org/W2745045892","https://openalex.org/W2896633576","https://openalex.org/W2901745114","https://openalex.org/W2902687529","https://openalex.org/W2922342388","https://openalex.org/W2962813697","https://openalex.org/W2962850796","https://openalex.org/W2963062115","https://openalex.org/W2963117124","https://openalex.org/W2964229375","https://openalex.org/W2976539128","https://openalex.org/W2995947286","https://openalex.org/W3002931341","https://openalex.org/W3100515187","https://openalex.org/W3103649678","https://openalex.org/W6738835244","https://openalex.org/W6742705821","https://openalex.org/W6748185915","https://openalex.org/W6767751307","https://openalex.org/W6773469843"],"related_works":["https://openalex.org/W4394590985","https://openalex.org/W2348840575","https://openalex.org/W2030498341","https://openalex.org/W3122841410","https://openalex.org/W2046205453","https://openalex.org/W2770017172","https://openalex.org/W89977309","https://openalex.org/W2183901182","https://openalex.org/W2030930882","https://openalex.org/W4300013323"],"abstract_inverted_index":{"Polynomial":[0],"coding":[1,144,158],"has":[2],"been":[3],"proposed":[4],"as":[5],"a":[6,102],"solution":[7],"to":[8,22,42,69,106,114,127],"the":[9,30,38,46,53,57,71,75,81,108,116,161],"straggler":[10],"mitigation":[11],"problem":[12],"in":[13,61,125],"distributed":[14,33,165],"matrix":[15,24,83,166],"multiplication.":[16,167],"Previous":[17],"works":[18],"employ":[19],"univariate":[20,128],"polynomials":[21],"encode":[23],"partitions.":[25],"Such":[26],"schemes":[27,145],"greatly":[28],"improve":[29],"speed":[31],"of":[32,64,74,111,164],"computing":[34,65],"systems":[35],"by":[36,56],"making":[37],"task":[39,85],"completion":[40],"time":[41,163],"depend":[43],"only":[44],"on":[45],"fastest":[47],"workers.":[48,123],"However,":[49,124],"they":[50],"completely":[51],"ignore":[52],"work":[54],"done":[55],"slowest":[58],"workers":[59],"resulting":[60],"inefficient":[62],"use":[63],"resources.":[66],"In":[67],"order":[68],"exploit":[70,115],"partial":[72],"computations":[73],"slower":[76],"workers,":[77],"we":[78,91],"further":[79],"decompose":[80],"overall":[82],"multiplication":[84],"into":[86],"even":[87],"smaller":[88],"subtasks,":[89,112],"and":[90,113,119,146],"propose":[92,140],"bivariate":[93,142,156],"polynomial":[94,129,143,157],"codes.":[95],"We":[96,139],"show":[97,154],"that":[98,155],"these":[99],"codes":[100],"are":[101],"more":[103],"natural":[104],"choice":[105],"accommodate":[107],"additional":[109],"decomposition":[110],"heterogeneous":[117],"storage":[118],"computation":[120,162],"resources":[121],"at":[122],"contrast":[126],"decoding,":[130],"guarantying":[131],"decodability":[132,149],"with":[133],"multivariate":[134],"interpolation":[135],"is":[136],"much":[137],"harder.":[138],"two":[141],"study":[147],"their":[148],"conditions.":[150],"Our":[151],"numerical":[152],"results":[153],"considerably":[159],"reduces":[160]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2020-09-01T00:00:00"}