{"id":"https://openalex.org/W2217939021","doi":"https://doi.org/10.1145/2789149.2789161","title":"Information Complexity and the Quest for Interactive Compression","display_name":"Information Complexity and the Quest for Interactive Compression","publication_year":2015,"publication_date":"2015-06-04","ids":{"openalex":"https://openalex.org/W2217939021","doi":"https://doi.org/10.1145/2789149.2789161","mag":"2217939021"},"language":"en","primary_location":{"id":"doi:10.1145/2789149.2789161","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2789149.2789161","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"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":"ACM SIGACT News","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/A5055582428","display_name":"Omri Weinstein","orcid":"https://orcid.org/0000-0002-9357-2299"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"O. Weinstein","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055582428"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":2.1031,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88121128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"46","issue":"2","first_page":"41","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9987000226974487,"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/communication-complexity","display_name":"Communication complexity","score":0.75685054063797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7156990170478821},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5367677211761475},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5236377716064453},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.5187031030654907},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.46665382385253906},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.456687331199646},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.45075106620788574},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.439802348613739},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21390748023986816},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18763786554336548}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.75685054063797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7156990170478821},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5367677211761475},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5236377716064453},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5187031030654907},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.46665382385253906},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.456687331199646},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.45075106620788574},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.439802348613739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21390748023986816},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18763786554336548},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2789149.2789161","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2789149.2789161","pdf_url":null,"source":{"id":"https://openalex.org/S4210206003","display_name":"ACM SIGACT News","issn_l":"0163-5700","issn":["0163-5700","1943-5827"],"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":"ACM SIGACT News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":69,"referenced_works":["https://openalex.org/W56793145","https://openalex.org/W190822590","https://openalex.org/W201917955","https://openalex.org/W337018396","https://openalex.org/W1521500249","https://openalex.org/W1523204110","https://openalex.org/W1608345992","https://openalex.org/W1831717676","https://openalex.org/W1970259241","https://openalex.org/W1979790324","https://openalex.org/W1994916325","https://openalex.org/W1995875735","https://openalex.org/W2002501531","https://openalex.org/W2010501977","https://openalex.org/W2010631958","https://openalex.org/W2012948111","https://openalex.org/W2022444580","https://openalex.org/W2025279645","https://openalex.org/W2033261280","https://openalex.org/W2035555798","https://openalex.org/W2038073775","https://openalex.org/W2038435918","https://openalex.org/W2042753471","https://openalex.org/W2057918151","https://openalex.org/W2060108852","https://openalex.org/W2078825942","https://openalex.org/W2081052967","https://openalex.org/W2083432171","https://openalex.org/W2085382249","https://openalex.org/W2086467753","https://openalex.org/W2091039687","https://openalex.org/W2097234068","https://openalex.org/W2100732817","https://openalex.org/W2102373437","https://openalex.org/W2103587345","https://openalex.org/W2104886711","https://openalex.org/W2107324709","https://openalex.org/W2107917944","https://openalex.org/W2108684595","https://openalex.org/W2110110846","https://openalex.org/W2114607430","https://openalex.org/W2123346469","https://openalex.org/W2129700748","https://openalex.org/W2133982000","https://openalex.org/W2141585995","https://openalex.org/W2152489475","https://openalex.org/W2152912600","https://openalex.org/W2162576315","https://openalex.org/W2187263185","https://openalex.org/W2398468127","https://openalex.org/W2400109196","https://openalex.org/W2401365016","https://openalex.org/W2402091320","https://openalex.org/W2402267017","https://openalex.org/W2403912935","https://openalex.org/W2406312945","https://openalex.org/W2473718805","https://openalex.org/W2496614101","https://openalex.org/W2555142029","https://openalex.org/W2581093780","https://openalex.org/W2611688713","https://openalex.org/W2912133662","https://openalex.org/W2953292636","https://openalex.org/W2993383518","https://openalex.org/W3037669392","https://openalex.org/W3104935792","https://openalex.org/W3157388067","https://openalex.org/W3172945542","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4387560420","https://openalex.org/W2003104918","https://openalex.org/W108605771","https://openalex.org/W1992687353","https://openalex.org/W2097465621","https://openalex.org/W4225548342","https://openalex.org/W2148482302","https://openalex.org/W2082224527","https://openalex.org/W349681616","https://openalex.org/W2407924029"],"abstract_inverted_index":{"Information":[0],"complexity":[1,39,48],"is":[2,49],"the":[3,33,50,55,67,85,96],"interactive":[4,101],"analogue":[5],"of":[6,32,46,54,69,84,99],"Shannon's":[7],"classical":[8],"information":[9,47,79],"theory.":[10],"In":[11],"recent":[12,86],"years":[13],"this":[14],"field":[15],"has":[16],"emerged":[17],"as":[18],"a":[19,75],"powerful":[20],"tool":[21],"for":[22,29],"proving":[23],"strong":[24],"communication":[25,38],"lower":[26],"bounds,":[27],"and":[28,40,59,81,91],"addressing":[30],"some":[31,83],"major":[34],"open":[35],"problems":[36],"in":[37,52],"circuit":[41],"complexity.":[42],"A":[43],"notable":[44],"achievement":[45],"breakthrough":[51],"understanding":[53],"fundamental":[56],"direct":[57,60],"sum":[58],"product":[61],"conjectures,":[62],"which":[63],"aim":[64],"to":[65,78],"quantify":[66],"power":[68],"parallel":[70],"computation.":[71],"This":[72],"survey":[73],"provides":[74],"brief":[76],"introduction":[77],"complexity,":[80],"overviews":[82],"progress":[87],"on":[88],"these":[89],"conjectures":[90],"their":[92],"tight":[93],"relationship":[94],"with":[95],"fascinating":[97],"problem":[98],"compressing":[100],"protocols.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}