{"id":"https://openalex.org/W2163605617","doi":"https://doi.org/10.1109/ccc.2003.1214415","title":"Rectangle size bounds and threshold covers in communication complexity","display_name":"Rectangle size bounds and threshold covers in communication complexity","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2163605617","doi":"https://doi.org/10.1109/ccc.2003.1214415","mag":"2163605617"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2003.1214415","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5018075693","display_name":"Hartmut Klauck","orcid":"https://orcid.org/0000-0003-1078-4593"},"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":true,"raw_author_name":"H. Klauck","raw_affiliation_strings":["Institute for Advanced Study, School of Mathematics, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, School of Mathematics, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018075693"],"corresponding_institution_ids":["https://openalex.org/I40036882"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T11130","display_name":"Coding theory and cryptography","score":0.9987999796867371,"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/rectangle","display_name":"Rectangle","score":0.7617455720901489},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6469236612319946},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6221374273300171},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46998846530914307},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41781607270240784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28130072355270386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2798919081687927},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08021941781044006}],"concepts":[{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.7617455720901489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6469236612319946},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6221374273300171},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46998846530914307},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41781607270240784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28130072355270386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2798919081687927},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08021941781044006}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ccc.2003.1214415","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214415","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.5975","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.5975","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cwi.nl/~klauck/0208006.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.3669","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.3669","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pages.cpsc.ucalgary.ca/~klauckh/./Rect.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W143396352","https://openalex.org/W1495129833","https://openalex.org/W1966278576","https://openalex.org/W1975732129","https://openalex.org/W1980223785","https://openalex.org/W1991730713","https://openalex.org/W2002501531","https://openalex.org/W2006787007","https://openalex.org/W2020029222","https://openalex.org/W2054081892","https://openalex.org/W2060972166","https://openalex.org/W2067002313","https://openalex.org/W2070053775","https://openalex.org/W2070486524","https://openalex.org/W2075106440","https://openalex.org/W2096390054","https://openalex.org/W2107917944","https://openalex.org/W2120210041","https://openalex.org/W2148957455","https://openalex.org/W2152221459","https://openalex.org/W2155075753","https://openalex.org/W2176316436","https://openalex.org/W2340787257","https://openalex.org/W2912956481","https://openalex.org/W2949863531","https://openalex.org/W4243302453","https://openalex.org/W6629632872"],"related_works":["https://openalex.org/W3106469975","https://openalex.org/W4302415779","https://openalex.org/W4387560420","https://openalex.org/W2940671439","https://openalex.org/W4301871063","https://openalex.org/W1501319629","https://openalex.org/W2465912158","https://openalex.org/W1506049346","https://openalex.org/W2402047242","https://openalex.org/W1500761685"],"abstract_inverted_index":{"We":[0,67,211],"investigate":[1],"the":[2,5,22,35,42,83,89,93,118,121,132,135,162,165,171,197,200],"power":[3],"of":[4,21,25,45,73,88,120,152,161,164,196,202,215,235],"most":[6],"important":[7],"lower":[8,94,136,166,240],"bound":[9,47,75,95,137,167,198,241],"technique":[10],"in":[11,55,169],"randomized":[12,64,143,246],"communication":[13,65,144,209,247],"complexity,":[14],"which":[15,170],"is":[16,39,48,58,124,139,176,180],"based":[17],"on":[18,34],"an":[19,203],"evaluation":[20],"maximal":[23],"size":[24],"approximately":[26],"monochromatic":[27],"rectangles,":[28],"with":[29],"respect":[30],"to":[31,115,199],"arbitrary":[32],"distributions":[33,175],"inputs.":[36],"While":[37],"it":[38],"known":[40,59],"that":[41,78,117,134],"0-error":[43],"version":[44,72,151],"this":[46,56,74,129,153],"polynomially":[49,140],"tight":[50,141],"for":[51,60,98,142,206,245],"deterministic":[52],"communication,":[53],"nothing":[54],"direction":[57],"constant":[61],"error":[62,188,217],"and":[63,76,85,108,113,192,225,228],"complexity.":[66,145,248],"first":[68],"study":[69,213],"a":[70,99,149,158,186,207,239],"one-sided":[71],"obtain":[77],"its":[79],"value":[80,163],"lies":[81],"between":[82,103,232],"MA-":[84],"AM-":[86],"complexities":[87],"considered":[90],"function.":[91],"Hence":[92],"actually":[96],"works":[97],"(communication)":[100],"complexity":[101],"class":[102],"MA/spl":[104],"cap/co":[105,110],"-":[106,111],"MA":[107],"AM/spl":[109],"AM,":[112],"allows":[114],"show":[116],"MA-complexity":[119],"disjointness":[122],"problem":[123],"/spl":[125],"Omega/(/spl":[126],"radic/n).":[127],"Following":[128],"we":[130,147,156,184],"consider":[131],"conjecture":[133],"method":[138,242],"First":[146],"disprove":[148],"distributional":[150],"conjecture.":[154],"Then":[155],"give":[157],"combinatorial":[159],"characterization":[160,179],"method,":[168],"optimization":[172],"over":[173],"all":[174],"absent.":[177],"This":[178],"done":[181],"by":[182],"what":[183],"call":[185],"bounded":[187,216],"uniform":[189,218],"threshold":[190,219],"cover,":[191],"reduces":[193],"showing":[194],"tightness":[195],"construction":[201],"efficient":[204],"protocol":[205],"specific":[208],"problem.":[210],"then":[212],"relaxations":[214],"covers,":[220,227],"namely":[221],"approximate":[222],"majority":[223,226],"covers":[224,237],"exhibit":[229],"exponential":[230],"separations":[231],"them.":[233],"Each":[234],"these":[236],"captures":[238],"previously":[243],"used":[244]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}