{"id":"https://openalex.org/W1507711139","doi":"https://doi.org/10.1007/3-540-45061-0_26","title":"A Direct Sum Theorem in Communication Complexity via Message Compression","display_name":"A Direct Sum Theorem in Communication Complexity via Message Compression","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1507711139","doi":"https://doi.org/10.1007/3-540-45061-0_26","mag":"1507711139"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45061-0_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45061-0_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5051676245","display_name":"Rahul Jain","orcid":"https://orcid.org/0000-0002-3649-6576"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rahul Jain","raw_affiliation_strings":["School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, 400005, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, 400005, India","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080324608","display_name":"Jaikumar Radhakrishnan","orcid":"https://orcid.org/0000-0002-3875-4620"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jaikumar Radhakrishnan","raw_affiliation_strings":["School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, 400005, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, 400005, India","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070609086","display_name":"Pranab Kumar Sen","orcid":"https://orcid.org/0000-0003-0193-8562"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pranab Sen","raw_affiliation_strings":["Department of Combinatorics and Optimisation, University of Waterloo, Waterloo, Ontario, N2L 3C1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimisation, University of Waterloo, Waterloo, Ontario, N2L 3C1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.7738,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.8323502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"300","last_page":"315"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9986000061035156,"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.9986000061035156,"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.9980999827384949,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6782482862472534},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6433883905410767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5999752879142761},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5795602798461914},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5325208306312561},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5015995502471924},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41793158650398254},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.41745537519454956},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37261492013931274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34157371520996094}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6782482862472534},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6433883905410767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5999752879142761},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5795602798461914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5325208306312561},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5015995502471924},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41793158650398254},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.41745537519454956},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37261492013931274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34157371520996094},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45061-0_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45061-0_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W201917955","https://openalex.org/W605043455","https://openalex.org/W1631356911","https://openalex.org/W1925966619","https://openalex.org/W2002501531","https://openalex.org/W2026480251","https://openalex.org/W2028406173","https://openalex.org/W2037817744","https://openalex.org/W2051019379","https://openalex.org/W2068871408","https://openalex.org/W2107917944","https://openalex.org/W2110110846","https://openalex.org/W2114607430","https://openalex.org/W2116255088","https://openalex.org/W2125841965","https://openalex.org/W2340787257","https://openalex.org/W2496163386","https://openalex.org/W3037687232","https://openalex.org/W4243302453"],"related_works":["https://openalex.org/W4291371193","https://openalex.org/W2580401938","https://openalex.org/W2396989770","https://openalex.org/W180602404","https://openalex.org/W2766478409","https://openalex.org/W2133996617","https://openalex.org/W1019628555","https://openalex.org/W1999551182","https://openalex.org/W2159271456","https://openalex.org/W3174634921"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":9}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}