{"id":"https://openalex.org/W4399523295","doi":"https://doi.org/10.1145/3618260.3649726","title":"XOR Lemmas for Communication via Marginal Information","display_name":"XOR Lemmas for Communication via Marginal Information","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399523295","doi":"https://doi.org/10.1145/3618260.3649726"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649726","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649726","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649726","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649726","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015651954","display_name":"S. Purushothaman Iyer","orcid":"https://orcid.org/0009-0005-9132-4389"},"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"]},{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Siddharth Iyer","raw_affiliation_strings":["University of Washington, Seattle, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, USA","institution_ids":["https://openalex.org/I201448701","https://openalex.org/I58610484"]}]},{"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"]},{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anup Rao","raw_affiliation_strings":["University of Washington, Seattle, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, USA","institution_ids":["https://openalex.org/I201448701","https://openalex.org/I58610484"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015651954"],"corresponding_institution_ids":["https://openalex.org/I201448701","https://openalex.org/I58610484"],"apc_list":null,"apc_paid":null,"fwci":0.7608,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7262424,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"652","last_page":"658"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11797","display_name":"graph theory and CDMA systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9988999962806702,"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/bounded-function","display_name":"Bounded function","score":0.7222139239311218},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.5757215023040771},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.568501889705658},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5575385093688965},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5455691814422607},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.536421537399292},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48879382014274597},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4750126302242279},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4404713809490204},{"id":"https://openalex.org/keywords/xor-gate","display_name":"XOR gate","score":0.4401877224445343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4359395205974579},{"id":"https://openalex.org/keywords/bitwise-operation","display_name":"Bitwise operation","score":0.4334483742713928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31293749809265137},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.08172404766082764}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7222139239311218},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.5757215023040771},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.568501889705658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5575385093688965},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5455691814422607},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.536421537399292},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48879382014274597},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4750126302242279},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4404713809490204},{"id":"https://openalex.org/C28495749","wikidata":"https://www.wikidata.org/wiki/Q155516","display_name":"XOR gate","level":3,"score":0.4401877224445343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4359395205974579},{"id":"https://openalex.org/C134765980","wikidata":"https://www.wikidata.org/wiki/Q879126","display_name":"Bitwise operation","level":2,"score":0.4334483742713928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31293749809265137},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.08172404766082764},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","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},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649726","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649726","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649726","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649726","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649726","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649726","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.6299999952316284,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399523295.pdf"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W190822590","https://openalex.org/W1507711139","https://openalex.org/W1589803317","https://openalex.org/W1979790324","https://openalex.org/W1995875735","https://openalex.org/W2007997869","https://openalex.org/W2022444580","https://openalex.org/W2033261280","https://openalex.org/W2070486524","https://openalex.org/W2086423976","https://openalex.org/W2086467753","https://openalex.org/W2108684595","https://openalex.org/W2110110846","https://openalex.org/W2114607430","https://openalex.org/W2141585995","https://openalex.org/W2201563107","https://openalex.org/W2291562724","https://openalex.org/W2405665546","https://openalex.org/W2413458571","https://openalex.org/W2556081204","https://openalex.org/W2759253428","https://openalex.org/W2795443780","https://openalex.org/W2808793218","https://openalex.org/W2963261968","https://openalex.org/W2963834565","https://openalex.org/W4211154544","https://openalex.org/W4243302453","https://openalex.org/W4313227409","https://openalex.org/W4316652268"],"related_works":["https://openalex.org/W2362925226","https://openalex.org/W1523834128","https://openalex.org/W3212703233","https://openalex.org/W1513451900","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W4206055950","https://openalex.org/W1981170240","https://openalex.org/W2130100567","https://openalex.org/W4288641573"],"abstract_inverted_index":{"We":[0,19,50],"define":[1],"the":[2,45,56],"marginal":[3],"information":[4],"of":[5],"a":[6,31],"communication":[7,17],"protocol,":[8],"and":[9,60,67],"use":[10],"it":[11],"to":[12],"prove":[13,51],"XOR":[14],"lemmas":[15],"for":[16,29,43,64,68],"complexity.":[18],"show":[20],"that":[21],"if":[22],"every":[23,36],"C-bit":[24],"protocol":[25,39],"has":[26,40],"bounded":[27],"advantage":[28,41],"computing":[30,44],"Boolean":[32],"function":[33],"f,":[34],"then":[35],"\u03a9(C":[37],"\u221an)-bit":[38],"exp(\u2212\u03a9(n))":[42],"n-fold":[46],"xor":[47],"f\u2295":[48],"n.":[49],"exponentially":[52],"small":[53],"bounds":[54,63],"in":[55],"average":[57],"case":[58],"setting,":[59],"near":[61],"optimal":[62],"product":[65],"distributions":[66],"bounded-round":[69],"protocols.":[70]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}