{"id":"https://openalex.org/W2066627246","doi":"https://doi.org/10.1109/tit.2014.2347282","title":"Information Equals Amortized Communication","display_name":"Information Equals Amortized Communication","publication_year":2014,"publication_date":"2014-08-13","ids":{"openalex":"https://openalex.org/W2066627246","doi":"https://doi.org/10.1109/tit.2014.2347282","mag":"2066627246"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2014.2347282","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2347282","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5042816355","display_name":"Mark Braverman","orcid":"https://orcid.org/0000-0003-1276-6081"},"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":"Mark Braverman","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","Department of Computer Science, Princeton University, Princeton , NJ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton , NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035012558","display_name":"Anup Rao","orcid":"https://orcid.org/0000-0002-6449-9547"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anup Rao","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Washington, Seattle, WA, USA","Department of Computer Science & Engineering, University of Washington, Seattle, WA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Department of Computer Science & Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042816355"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":8.4082,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.98070123,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"60","issue":"10","first_page":"6058","last_page":"6069"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10237","display_name":"Cryptography and Data Security","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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994000196456909,"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/communication-complexity","display_name":"Communication complexity","score":0.7487197518348694},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4869447946548462},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.486388236284256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48219600319862366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46199607849121094},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45605891942977905},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4318195581436157},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4201720356941223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.279690146446228}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7487197518348694},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4869447946548462},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.486388236284256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48219600319862366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46199607849121094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45605891942977905},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4318195581436157},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4201720356941223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.279690146446228},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tit.2014.2347282","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2014.2347282","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.190.4562","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.4562","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/%7Embraverm/Papers/amortizedcommunication.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.499.8305","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.499.8305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homes.cs.washington.edu/~anuprao/pubs/roundcompressfull.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.756.7186","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.756.7186","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1106.3595.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8233928647","display_name":null,"funder_award_id":"1149888","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320309292","display_name":"Princeton University","ror":"https://ror.org/00hx57361"},{"id":"https://openalex.org/F4320309321","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44"},{"id":"https://openalex.org/F4320336061","display_name":"Research England","ror":"https://ror.org/02wxr8x18"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W190822590","https://openalex.org/W1507711139","https://openalex.org/W1515359378","https://openalex.org/W1968936186","https://openalex.org/W1979790324","https://openalex.org/W1994916325","https://openalex.org/W1995875735","https://openalex.org/W2033261280","https://openalex.org/W2042753471","https://openalex.org/W2078825942","https://openalex.org/W2086467753","https://openalex.org/W2087464967","https://openalex.org/W2099111195","https://openalex.org/W2099213070","https://openalex.org/W2102373437","https://openalex.org/W2107917944","https://openalex.org/W2108684595","https://openalex.org/W2110110846","https://openalex.org/W2114607430","https://openalex.org/W2123346469","https://openalex.org/W2138185924","https://openalex.org/W2141432745","https://openalex.org/W2152912600","https://openalex.org/W2154378347","https://openalex.org/W2396183276","https://openalex.org/W3157388067","https://openalex.org/W6630980872"],"related_works":["https://openalex.org/W2005285611","https://openalex.org/W49472806","https://openalex.org/W4316652422","https://openalex.org/W4210355121","https://openalex.org/W1994916325","https://openalex.org/W2556081204","https://openalex.org/W2027620237","https://openalex.org/W1968633117","https://openalex.org/W1506049346","https://openalex.org/W4232879136"],"abstract_inverted_index":{"We":[0,139],"show":[1,141],"how":[2,61],"to":[3,13,36,46,62,105,124,146],"efficiently":[4],"simulate":[5],"the":[6,21,25,32,37,43,47,56,73,97,102,106,125,134,143,164,211],"sending":[7],"of":[8,28,39,55,81,129,133,163,190,204,214],"a":[9,14,51,66,78,92,116,148,160,175,201],"single":[10],"message":[11,44],"M":[12,76],"receiver":[15],"who":[16],"has":[17],"partial":[18],"information":[19,41,99,103],"about":[20],"message,":[22],"so":[23],"that":[24,42,75,86,96,142,168,174,210],"expected":[26],"number":[27],"bits":[29],"communicated":[30],"in":[31,72,109],"simulation":[33,67,88],"is":[34,50,77,85,89,121,157,193,221],"close":[35],"amount":[38],"additional":[40],"reveals":[45],"receiver.":[48],"This":[49,171],"generalization":[52],"and":[53,185,207],"strengthening":[54],"Slepian-Wolf":[57],"theorem,":[58],"which":[59],"shows":[60],"carry":[63],"out":[64],"such":[65],"with":[68,198],"low":[69],"amortized":[70,126],"communication":[71,127,155,181,191,219],"case":[74],"deterministic":[79],"function":[80,114],"X.":[82],"A":[83],"caveat":[84],"our":[87,199],"interactive.":[90],"As":[91],"consequence,":[93],"we":[94,169],"prove":[95,147],"internal":[98],"cost":[100],"(namely":[101],"revealed":[104],"parties)":[107],"involved":[108],"computing":[110,130],"any":[111],"relation":[112,136],"or":[113,137],"using":[115],"two":[117],"party":[118],"interactive":[119],"protocol":[120],"exactly":[122],"equal":[123],"complexity":[128,156,182,220],"independent":[131],"copies":[132],"same":[135],"function.":[138],"also":[140],"only":[144,186],"way":[145],"strong":[149,176],"direct":[150,177,215],"sum":[151,178,216],"theorem":[152,179],"for":[153,180,217],"randomized":[154,218],"by":[158],"solving":[159],"particular":[161],"variant":[162],"pointer":[165],"jumping":[166],"problem":[167],"define.":[170],"paper":[172],"implies":[173,209],"holds":[183],"if":[184,187],"efficient":[188],"compression":[189],"protocols":[192],"possible.":[194],"In":[195],"particular,":[196],"together":[197],"result,":[200],"recent":[202],"result":[203],"Ganor,":[205],"Kol,":[206],"Raz":[208],"strongest":[212],"version":[213],"false.":[222]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}