{"id":"https://openalex.org/W2983047550","doi":"https://doi.org/10.1145/3575807","title":"Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time","display_name":"Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time","publication_year":2022,"publication_date":"2022-12-14","ids":{"openalex":"https://openalex.org/W2983047550","doi":"https://doi.org/10.1145/3575807","mag":"2983047550"},"language":"en","primary_location":{"id":"doi:10.1145/3575807","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3575807","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-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/A5040564003","display_name":"Bruno Bauwens","orcid":"https://orcid.org/0000-0002-6138-0591"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Bruno Bauwens*","raw_affiliation_strings":["National Research University Higher School of Economics, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"National Research University Higher School of Economics, Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046763801","display_name":"Marius Zimand","orcid":"https://orcid.org/0000-0002-5938-6599"},"institutions":[{"id":"https://openalex.org/I4322298","display_name":"Towson University","ror":"https://ror.org/044w7a341","country_code":"US","type":"education","lineage":["https://openalex.org/I4322298"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marius Zimand","raw_affiliation_strings":["Towson University, Towson, MD, USA"],"affiliations":[{"raw_affiliation_string":"Towson University, Towson, MD, USA","institution_ids":["https://openalex.org/I4322298"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040564003"],"corresponding_institution_ids":["https://openalex.org/I118501908"],"apc_list":null,"apc_paid":null,"fwci":0.1461,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.42341357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"70","issue":"2","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":1.0,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6844357848167419},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5501410365104675},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5271182656288147},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5210994482040405},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.47527995705604553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45947566628456116},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4396533668041229},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4375256597995758},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4063962697982788},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37501129508018494},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37004220485687256},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13984361290931702}],"concepts":[{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6844357848167419},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5501410365104675},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5271182656288147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5210994482040405},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.47527995705604553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45947566628456116},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4396533668041229},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4375256597995758},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4063962697982788},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37501129508018494},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37004220485687256},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13984361290931702},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3575807","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3575807","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7996680152","display_name":null,"funder_award_id":"20-11-20203","funder_id":"https://openalex.org/F4320324099","funder_display_name":"Russian Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320324099","display_name":"Russian Science Foundation","ror":"https://ror.org/03y2gwe85"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W79265410","https://openalex.org/W1496328033","https://openalex.org/W1601197949","https://openalex.org/W1638203394","https://openalex.org/W1826494283","https://openalex.org/W1971134387","https://openalex.org/W1992499648","https://openalex.org/W1995875735","https://openalex.org/W2022038544","https://openalex.org/W2029308360","https://openalex.org/W2035532007","https://openalex.org/W2039982631","https://openalex.org/W2050348803","https://openalex.org/W2060108852","https://openalex.org/W2060474153","https://openalex.org/W2073445540","https://openalex.org/W2077050034","https://openalex.org/W2077770566","https://openalex.org/W2087075202","https://openalex.org/W2090418561","https://openalex.org/W2099111195","https://openalex.org/W2099213070","https://openalex.org/W2103012681","https://openalex.org/W2119913278","https://openalex.org/W2132559993","https://openalex.org/W2136864990","https://openalex.org/W2148180254","https://openalex.org/W2155676967","https://openalex.org/W2162635854","https://openalex.org/W2257651885","https://openalex.org/W2478708596","https://openalex.org/W2571410429","https://openalex.org/W2573218979","https://openalex.org/W2606059309","https://openalex.org/W2610867264","https://openalex.org/W2906848741","https://openalex.org/W2953227235","https://openalex.org/W2962857961","https://openalex.org/W3138266838","https://openalex.org/W4205550388","https://openalex.org/W4212992501","https://openalex.org/W4233413206","https://openalex.org/W4251984466","https://openalex.org/W4252306800","https://openalex.org/W6629816883"],"related_works":["https://openalex.org/W2948148442","https://openalex.org/W2461250372","https://openalex.org/W2394342941","https://openalex.org/W2169853506","https://openalex.org/W2547124190","https://openalex.org/W1558425494","https://openalex.org/W2350586049","https://openalex.org/W2385628723","https://openalex.org/W2169871401","https://openalex.org/W3008492011"],"abstract_inverted_index":{"In":[0],"a":[1,8,16,33,43,78,156],"lossless":[2],"compression":[3,202],"system":[4],"with":[5],"target":[6],"lengths,":[7],"compressor":[9,63,123,158,188],"\ud835\udc9e":[10,64,145,150,153],"maps":[11],"an":[12,21,61,121],"integer":[13],"m":[14,22,29,92],"and":[15,27,129,210],"binary":[17],"string":[18],"x":[19,37,96],"to":[20],"-bit":[23],"code":[24],"p":[25,39],",":[26,95,103],"if":[28,51,84,149],"is":[30,54,86,98,109,151,155,174,179],"sufficiently":[31],"large,":[32],"decompressor":[34,79,178],"\ud835\udc9f":[35,80,104],"reconstructs":[36],"from":[38],".":[40],"We":[41,56,116,181],"call":[42],"pair":[44,74,139],"(":[45,91],"m,x":[46],")":[47,97],"achievable":[48,87,99],"for":[49,88,100,137,192,212],"(\ud835\udc9e,\ud835\udc9f)":[50],"this":[52,218],"reconstruction":[53],"successful.":[55],"introduce":[57],"the":[58,67,114,176,207,213],"notion":[59],"of":[60,170,217],"optimal":[62,122,187,201],"opt":[65,102,154],"by":[66],"following":[68],"universality":[69],"property:":[70],"For":[71],"any":[72,138],"compressor-decompressor":[73],"(\ud835\udc9e,\ud835\udc9f),":[75,89,140],"there":[76,119],"exists":[77,120],"\u2032":[81,105],"such":[82,186],"that":[83,118,124,159,175,184],"(m,x)":[85],"then":[90],"+":[93],"\u0394":[94,108],"(\ud835\udc9e":[101],"),":[106],"where":[107],"some":[110],"small":[111],"value":[112],"called":[113],"overhead.":[115],"show":[117,183],"has":[125],"only":[126],"polylogarithmic":[127],"overhead":[128],"works":[130],"in":[131,160,195,206],"probabilistic":[132],"polynomial":[133,161],"time.":[134],"Differently":[135],"said,":[136],"no":[141],"matter":[142],"how":[143],"slow":[144],"is,":[146],"or":[147],"even":[148,211],"non-computable,":[152],"fixed":[157],"time":[162],"produces":[163],"codes":[164],"almost":[165],"as":[166,168,204],"short":[167],"those":[169],"\ud835\udc9e.":[171],"The":[172],"cost":[173],"corresponding":[177],"slower.":[180],"also":[182],"each":[185],"can":[189,199],"be":[190],"used":[191],"distributed":[193],"compression,":[194],"which":[196],"case":[197],"it":[198],"achieve":[200],"rates":[203],"given":[205],"Slepian\u2013Wolf":[208],"theorem":[209],"Kolmogorov":[214],"complexity":[215],"variant":[216],"theorem.":[219]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}