{"id":"https://openalex.org/W1972068724","doi":"https://doi.org/10.1007/s00037-007-0220-2","title":"A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness","display_name":"A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness","publication_year":2006,"publication_date":"2006-12-01","ids":{"openalex":"https://openalex.org/W1972068724","doi":"https://doi.org/10.1007/s00037-007-0220-2","mag":"1972068724"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-007-0220-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0220-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0220-2.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0220-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042076941","display_name":"Paul Beame","orcid":"https://orcid.org/0000-0002-2666-3545"},"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":true,"raw_author_name":"Paul Beame","raw_affiliation_strings":["Computer Science & Engineering, University of Washington, Seattle, WA, 98195-2350, USA","Computer Science & Engineering, University of Washington, Seattle, USA 98195-2350"],"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering, University of Washington, Seattle, WA, 98195-2350, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Computer Science & Engineering, University of Washington, Seattle, USA 98195-2350","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003318200","display_name":"Toniann Pitassi","orcid":"https://orcid.org/0000-0002-8668-2174"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Toniann Pitassi","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, ON, M5S 1A4, Canada","Dept. of Computer Science, University of Toronto, Toronto, Canada, M5S 1A4#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, ON, M5S 1A4, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Toronto, Toronto, Canada, M5S 1A4#TAB#","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039320961","display_name":"Nathan Segerlind","orcid":null},"institutions":[{"id":"https://openalex.org/I126345244","display_name":"Portland State University","ror":"https://ror.org/00yn2fy02","country_code":"US","type":"education","lineage":["https://openalex.org/I126345244"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan Segerlind","raw_affiliation_strings":["Department of Computer Science, Portland State University, Portland, OR, 97207-0751, USA","Department of Computer Science, Portland State University, Portland, USA 97207-0751"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Portland State University, Portland, OR, 97207-0751, USA","institution_ids":["https://openalex.org/I126345244"]},{"raw_affiliation_string":"Department of Computer Science, Portland State University, Portland, USA 97207-0751","institution_ids":["https://openalex.org/I126345244"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039043184","display_name":"Avi Wigderson","orcid":"https://orcid.org/0000-0002-1539-1417"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Avi Wigderson","raw_affiliation_strings":["School of Mathematics, Institute for Advanced Study, Princeton, NJ, 05840, USA","School of Mathematics, Institute for Advanced Study, Princeton, USA 05840"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, Institute for Advanced Study, Princeton, NJ, 05840, USA","institution_ids":["https://openalex.org/I40036882"]},{"raw_affiliation_string":"School of Mathematics, Institute for Advanced Study, Princeton, USA 05840","institution_ids":["https://openalex.org/I40036882"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5042076941"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":4.0442,"has_fulltext":true,"cited_by_count":44,"citation_normalized_percentile":{"value":0.93570639,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"4","first_page":"391","last_page":"432"},"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.9995999932289124,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9972000122070312,"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/corollary","display_name":"Corollary","score":0.7834860682487488},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7641131281852722},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6797407269477844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6395742893218994},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.6023702025413513},{"id":"https://openalex.org/keywords/direct-product","display_name":"Direct product","score":0.5704731941223145},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5203266143798828},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46453315019607544},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4563156068325043},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4148942232131958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3291630148887634}],"concepts":[{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.7834860682487488},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7641131281852722},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6797407269477844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6395742893218994},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.6023702025413513},{"id":"https://openalex.org/C58193220","wikidata":"https://www.wikidata.org/wiki/Q1778193","display_name":"Direct product","level":2,"score":0.5704731941223145},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5203266143798828},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46453315019607544},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4563156068325043},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4148942232131958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3291630148887634},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00037-007-0220-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0220-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0220-2.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.75.5491","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.5491","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/beame/papers/directjournal.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/s00037-007-0220-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0220-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0220-2.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.8299999833106995}],"awards":[{"id":"https://openalex.org/G4869637327","display_name":"ITR Medium Award:     Computational Complexity Theory 2003","funder_award_id":"0324906","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5274773415","display_name":"PostDoctoral Research Fellowship","funder_award_id":"0303258","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7396413225","display_name":"Lower Bounds for Time-space Tradeoffs, Data Structures, and Proof Complexity","funder_award_id":"0098066","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7533930318","display_name":"ITR:    Inference in AI, Verification, and Theory:    A Unified Approach","funder_award_id":"0219468","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8337943720","display_name":"Communication Complexity, Proof Complexity, and Approximation","funder_award_id":"0514870","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G856527327","display_name":null,"funder_award_id":"Postdoctoral","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310094","display_name":"University of Washington","ror":"https://ror.org/00cvxb145"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1972068724.pdf","grobid_xml":"https://content.openalex.org/works/W1972068724.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W99865627","https://openalex.org/W281465961","https://openalex.org/W285471286","https://openalex.org/W1507711139","https://openalex.org/W1572290526","https://openalex.org/W1599370812","https://openalex.org/W1805653176","https://openalex.org/W1905573593","https://openalex.org/W1925966619","https://openalex.org/W1948038071","https://openalex.org/W1966278576","https://openalex.org/W1970259241","https://openalex.org/W1980223785","https://openalex.org/W1985293484","https://openalex.org/W1992185863","https://openalex.org/W1992641578","https://openalex.org/W2007654329","https://openalex.org/W2010631958","https://openalex.org/W2010730726","https://openalex.org/W2041210515","https://openalex.org/W2044575164","https://openalex.org/W2051019379","https://openalex.org/W2054081892","https://openalex.org/W2064379477","https://openalex.org/W2070486524","https://openalex.org/W2074564146","https://openalex.org/W2079401865","https://openalex.org/W2080745194","https://openalex.org/W2092653296","https://openalex.org/W2099111195","https://openalex.org/W2107917944","https://openalex.org/W2114607430","https://openalex.org/W2120210041","https://openalex.org/W2126244834","https://openalex.org/W2137416782","https://openalex.org/W2139128805","https://openalex.org/W2141585995","https://openalex.org/W2148211896","https://openalex.org/W2152489475","https://openalex.org/W2163605617","https://openalex.org/W2340787257","https://openalex.org/W2611355853","https://openalex.org/W2912956481","https://openalex.org/W2949992932","https://openalex.org/W4233492952","https://openalex.org/W4243302453","https://openalex.org/W6638163778","https://openalex.org/W6670577890","https://openalex.org/W6678680931","https://openalex.org/W6736884243"],"related_works":["https://openalex.org/W2795963392","https://openalex.org/W1513451900","https://openalex.org/W4288641573","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2949083013","https://openalex.org/W2328371232","https://openalex.org/W4301486203","https://openalex.org/W1481287275","https://openalex.org/W4293861906"],"abstract_inverted_index":{"We":[0,33],"prove":[1,37],"that":[2,97],"two-party":[3],"randomized":[4,77,99],"communication":[5,17,109],"complexity":[6],"satisfies":[7],"a":[8,23,30],"strong":[9],"direct":[10],"product":[11],"property,":[12],"so":[13],"long":[14],"as":[15],"the":[16,49,56,81,112],"lower":[18,41,73],"bound":[19,74],"is":[20,96],"proved":[21],"by":[22],"\u201ccorruption\u201d":[24],"or":[25],"\u201cone-sided":[26],"discrepancy\u201d":[27],"method":[28],"over":[29],"rectangular":[31],"distribution.":[32],"use":[34],"this":[35,95],"to":[36,110],"new":[38],"n":[39],"\u03a9(1)":[40],"bounds":[42],"for":[43,75,80],"3-player":[44],"number-on-the-forehead":[45,78,100],"protocols":[46,79,101],"in":[47,84],"which":[48,85],"first":[50],"player":[51],"speaks":[52],"once":[53],"and":[54],"then":[55],"other":[57,63],"two":[58],"players":[59],"proceed":[60],"arbitrarily.":[61],"Using":[62],"techniques,":[64],"we":[65],"also":[66],"establish":[67],"an":[68],"\u03a9(n":[69],"1/(k\u22121)/(k":[70],"\u2212":[71,105],"1))":[72,106],"k-player":[76],"disjointness":[82,113],"function":[83],"all":[86],"messages":[87],"are":[88],"broadcast":[89],"simultaneously.":[90],"A":[91],"simple":[92],"corollary":[93],"of":[94,108],"general":[98],"require":[102],"\u03a9(log":[103],"n/(k":[104],"bits":[107],"compute":[111],"function.":[114]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}