{"id":"https://openalex.org/W2260000333","doi":"https://doi.org/10.1145/3055399.3055421","title":"Kolmogorov complexity version of Slepian-Wolf coding","display_name":"Kolmogorov complexity version of Slepian-Wolf coding","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2260000333","doi":"https://doi.org/10.1145/3055399.3055421","mag":"2260000333"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1511.03602","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Marius Zimand","raw_affiliation_strings":["Towson University, USA"],"affiliations":[{"raw_affiliation_string":"Towson University, USA","institution_ids":["https://openalex.org/I4322298"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046763801"],"corresponding_institution_ids":["https://openalex.org/I4322298"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.00761852,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"22","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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/T12029","display_name":"DNA and Biological Computing","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"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/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.6192759275436401},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6089229583740234},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5695730447769165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5652223229408264},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5469673871994019},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4813557267189026},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4728921949863434},{"id":"https://openalex.org/keywords/kolmogorov-structure-function","display_name":"Kolmogorov structure function","score":0.4614085257053375},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.453220009803772},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.448182612657547},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4177629351615906},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4144597351551056},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41290485858917236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2779393494129181},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17790958285331726},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.13041678071022034}],"concepts":[{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.6192759275436401},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6089229583740234},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5695730447769165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5652223229408264},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5469673871994019},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4813557267189026},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4728921949863434},{"id":"https://openalex.org/C15995199","wikidata":"https://www.wikidata.org/wiki/Q5805968","display_name":"Kolmogorov structure function","level":3,"score":0.4614085257053375},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.453220009803772},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.448182612657547},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4177629351615906},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4144597351551056},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41290485858917236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2779393494129181},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17790958285331726},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13041678071022034},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","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},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3055399.3055421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1511.03602","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1511.03602","pdf_url":"https://arxiv.org/pdf/1511.03602","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2260000333","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1511.03602.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1511.03602","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1511.03602","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1511.03602","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1511.03602","pdf_url":"https://arxiv.org/pdf/1511.03602","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2260000333.pdf","grobid_xml":"https://content.openalex.org/works/W2260000333.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1496328033","https://openalex.org/W1511186238","https://openalex.org/W1601197949","https://openalex.org/W2019807548","https://openalex.org/W2022038544","https://openalex.org/W2050348803","https://openalex.org/W2073445540","https://openalex.org/W2077050034","https://openalex.org/W2088587246","https://openalex.org/W2099111195","https://openalex.org/W2099213070","https://openalex.org/W2119913278","https://openalex.org/W2148180254","https://openalex.org/W2155676967","https://openalex.org/W2162635854","https://openalex.org/W2257651885","https://openalex.org/W2335357082","https://openalex.org/W2343971969","https://openalex.org/W2571410429","https://openalex.org/W2953227235","https://openalex.org/W2964111135","https://openalex.org/W2964220556"],"related_works":["https://openalex.org/W2962857961","https://openalex.org/W2964131289","https://openalex.org/W2752544888","https://openalex.org/W1534635560","https://openalex.org/W2001034866","https://openalex.org/W2769279287","https://openalex.org/W2030867687","https://openalex.org/W1560515871","https://openalex.org/W2002095405","https://openalex.org/W1578488848","https://openalex.org/W3081984408","https://openalex.org/W2407786731","https://openalex.org/W2417273130","https://openalex.org/W1541245190","https://openalex.org/W3081892506","https://openalex.org/W1503798378","https://openalex.org/W2293337465","https://openalex.org/W2951420633","https://openalex.org/W2503553525","https://openalex.org/W2080105954"],"abstract_inverted_index":{"Alice":[0,45],"and":[1,19,46,74,100,104,145,177,234,275],"Bob":[2],"are":[3,117,236,288],"given":[4],"two":[5,118,239],"correlated":[6,206],"n-bit":[7],"strings":[8,57],"x1":[9,233],"and,":[10],"respectively,":[11],"x2,":[12],"which":[13,232],"they":[14],"want":[15],"to":[16,21,58,258],"losslessly":[17],"compress":[18,55],"send":[20],"Zack.":[22],"They":[23],"can":[24,54,75],"either":[25],"collaborate":[26],"by":[27,187],"sharing":[28],"their":[29,56],"strings,":[30],"or":[31],"work":[32],"separately.":[33],"We":[34],"show":[35],"that":[36,83,157,287],"there":[37,94],"is":[38,181,192,209,273],"no":[39,269],"disadvantage":[40],"in":[41,63,107,212,227,231],"the":[42,50,64,111,171,182,199,213,220,252,255,260,264,276,285],"second":[43],"scenario:":[44],"Bob,":[47],"without":[48],"knowing":[49],"other":[51],"party's":[52],"string,":[53],"almost":[59],"minimal":[60],"description":[61],"length":[62,151],"sense":[65],"of":[66,81,150,175,184,201,205,215,219,238,263,271],"Kolmogorov":[67,173],"complexity.":[68],"Furthermore,":[69],"compression":[70,200],"takes":[71],"polynomial":[72,108],"time":[73],"be":[76],"made":[77],"at":[78],"any":[79,202,281],"combination":[80],"lengths":[82],"satisfy":[84],"some":[85],"necessary":[86],"conditions":[87],"(modulo":[88],"additive":[89],"polylogarithmic":[90],"terms).":[91],"More":[92],"precisely,":[93],"exist":[95],"probabilistic":[96],"algorithms":[97],"E1,":[98],"E2,":[99],"D,":[101],"with":[102,165,198],"E1":[103],"E2":[105],"running":[106],"time,":[109],"having":[110],"following":[112],"behavior:":[113],"if":[114],"n1,":[115],"n2":[116,123,131],"integers":[119],"satisfying":[120],"n1":[121,126],"+":[122,153],"\u2265":[124,127,132],"C(x1,x2),":[125],"C(x1":[128],"|":[129,134,179],"x2),":[130],"C(x2":[133],"x1),":[135],"then":[136],"for":[137],"i":[138],"\u2208":[139],"{1,2},":[140],"Ei":[141],"on":[142,159],"input":[143,160],"xi":[144],"ni":[146,152],"outputs":[147],"a":[148,224,248],"string":[149],"O(log3":[154],"n)":[155],"such":[156],"D":[158],"E1(x1),":[161],"E2(x2)":[162],"reconstructs":[163],"(x1,x2)":[164],"high":[166],"probability":[167],"(where":[168],"C(x)":[169],"denotes":[170],"plain":[172],"complexity":[174,183],"x,":[176],"C(x":[178],"y)":[180],"x":[185],"conditioned":[186],"y).":[188],"Our":[189],"main":[190],"result":[191,226,268],"more":[193],"general,":[194],"as":[195],"it":[196],"deals":[197],"constant":[203],"number":[204],"strings.":[207],"It":[208],"an":[210],"analog":[211],"framework":[214],"algorithmic":[216],"information":[217,229,283],"theory":[218],"classic":[221],"Slepian-Wolf":[222],"Theorem,":[223],"fundamental":[225],"network":[228],"theory,":[230],"x2":[235],"realizations":[237],"discrete":[240],"random":[241],"variables":[242],"representing":[243],"n":[244],"independent":[245],"draws":[246],"from":[247],"joint":[249,261],"distribution.":[250],"In":[251,266],"classical":[253],"result,":[254],"decompressor":[256,277],"needs":[257],"know":[259],"distribution":[262],"sources.":[265],"our":[267],"type":[270],"independence":[272],"assumed":[274],"does":[278],"not":[279],"have":[280],"prior":[282],"about":[284],"sources":[286],"compressed.":[289]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}