{"id":"https://openalex.org/W4411278180","doi":"https://doi.org/10.1145/3732772.3733515","title":"Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them","display_name":"Brief Announcement: Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them","publication_year":2025,"publication_date":"2025-06-13","ids":{"openalex":"https://openalex.org/W4411278180","doi":"https://doi.org/10.1145/3732772.3733515"},"language":"en","primary_location":{"id":"doi:10.1145/3732772.3733515","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3732772.3733515","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3732772.3733515","source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3732772.3733515","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071869723","display_name":"Cl\u00e9ment L. Canonne","orcid":"https://orcid.org/0000-0001-7153-5211"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Cl\u00e9ment Canonne","raw_affiliation_strings":["School of Computer Science, University of Sydney, Sydney, Australia"],"raw_orcid":"https://orcid.org/0000-0001-7153-5211","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Yun Li","orcid":"https://orcid.org/0009-0007-5291-126X"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Yun Li","raw_affiliation_strings":["University of Sydney, Sydney, Australia"],"raw_orcid":"https://orcid.org/0009-0007-5291-126X","affiliations":[{"raw_affiliation_string":"University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066531115","display_name":"Seeun William Umboh","orcid":"https://orcid.org/0000-0001-6984-4007"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Seeun William Umboh","raw_affiliation_strings":["The University of Melbourne, Melbourne, Victoria, Australia"],"raw_orcid":"https://orcid.org/0000-0001-6984-4007","affiliations":[{"raw_affiliation_string":"The University of Melbourne, Melbourne, Victoria, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14626418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"372","last_page":"374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9966999888420105,"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/impossibility","display_name":"Impossibility","score":0.8901468515396118},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8818449974060059},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7153327465057373},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6404111981391907},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45311176776885986},{"id":"https://openalex.org/keywords/political-science","display_name":"Political science","score":0.04288822412490845}],"concepts":[{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.8901468515396118},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8818449974060059},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7153327465057373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6404111981391907},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45311176776885986},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.04288822412490845},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3732772.3733515","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3732772.3733515","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3732772.3733515","source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/362037","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3732772.3733515.","pdf_url":null,"source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PODC '25: ACM Symposium on Principles of Distributed Computing","raw_type":"Conference Paper"}],"best_oa_location":{"id":"doi:10.1145/3732772.3733515","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3732772.3733515","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3732772.3733515","source":null,"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411278180.pdf","grobid_xml":"https://content.openalex.org/works/W4411278180.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W329165401","https://openalex.org/W1618811119","https://openalex.org/W2560686414","https://openalex.org/W4282038170","https://openalex.org/W4302013234","https://openalex.org/W4307822755","https://openalex.org/W4388787535"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2384156839","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362"],"abstract_inverted_index":{"Local":[0],"Computation":[1],"Algorithms":[2],"(LCA),":[3],"as":[4,99],"introduced":[5],"by":[6],"Rubinfeld,":[7],"Tamir,":[8],"Vardi,":[9],"and":[10,129,132,154],"Xie":[11],"(2011),":[12],"are":[13,31],"a":[14,23,27,39,45,64,71,140,157],"type":[15],"of":[16,51,63,93,101,146,163,169],"ultra-efficient":[17],"algorithms":[18,150],"which,":[19],"given":[20,28,65],"access":[21,37,69,113],"to":[22,33,38,70,114,124,142,161],"(large)":[24],"input":[25],"for":[26,56,97,148,166],"computational":[29],"task,":[30],"required":[32],"provide":[34,67],"fast":[35],"query":[36,133],"consistent":[40,68],"output":[41,73],"solution,":[42],"without":[43],"maintaining":[44],"state":[46],"between":[47],"queries.":[48],"This":[49],"paradigm":[50],"computation":[52],"in":[53],"particular":[54],"allows":[55,122],"hugely":[57],"distributed":[58],"algorithms,":[59],"where":[60],"independent":[61,164],"instances":[62],"LCA":[66,81,96,110],"common":[72],"solution.":[74],"We":[75,83,104],"study":[76],"the":[77,91,109,115,143,167],"Knapsack":[78,98,116],"Problem":[79],"under":[80],"model.":[82],"first":[84],"establish":[85],"strong":[86],"impossibility":[87,127],"results,":[88,128],"ruling":[89],"out":[90],"existence":[92],"any":[94],"non-trivial":[95],"several":[100],"its":[102],"relaxations.":[103],"then":[105],"show":[106],"how":[107],"equipping":[108],"with":[111],"additional":[112],"instance,":[117],"namely,":[118],"weighted":[119],"item":[120],"sampling,":[121],"one":[123],"circumvent":[125],"these":[126],"obtain":[130],"sublinear-time":[131],"LCAs.":[134,170],"Our":[135],"positive":[136],"result":[137],"draws":[138],"on":[139],"connection":[141,158],"recent":[144],"notion":[145],"reproducibility":[147],"learning":[149],"(Impagliazzo,":[151],"Lei,":[152],"Pitassi,":[153],"Sorrell,":[155],"2022),":[156],"we":[159],"believe":[160],"be":[162],"interest":[165],"design":[168]},"counts_by_year":[],"updated_date":"2026-09-02T18:50:13.731487","created_date":"2025-10-10T00:00:00"}