{"id":"https://openalex.org/W2141585995","doi":"https://doi.org/10.1007/bf01206317","title":"Super-logarithmic depth lower bounds via the direct sum in communication complexity","display_name":"Super-logarithmic depth lower bounds via the direct sum in communication complexity","publication_year":1995,"publication_date":"1995-09-01","ids":{"openalex":"https://openalex.org/W2141585995","doi":"https://doi.org/10.1007/bf01206317","mag":"2141585995"},"language":"en","primary_location":{"id":"doi:10.1007/bf01206317","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01206317","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088989735","display_name":"Mauricio Karchmer","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mauricio Karchmer","raw_affiliation_strings":["Dept. of Mathematics, M.I.T., 02139, Cambridge, MA","Department of Mathematics M.I.T., Cambridge,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics, M.I.T., 02139, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Department of Mathematics M.I.T., Cambridge,","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ran Raz","raw_affiliation_strings":["Dept. of App. Mathematics, Weizmann Institute, 76100, Rehovot, Israel","Dept. of App. Mathematics, Weizmann Institute, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of App. Mathematics, Weizmann Institute, 76100, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"Dept. of App. Mathematics, Weizmann Institute, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"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/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Avi Wigderson","raw_affiliation_strings":["Dept. of Computer Science, Hebrew University, Jerusalem, Israel","[Department of Computer Science, Hebrew University, Jerusalem, Israel]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"[Department of Computer Science, Hebrew University, Jerusalem, Israel]","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.17058349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"5","issue":"3-4","first_page":"191","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.762872040271759},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7617586851119995},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.533503532409668},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5038096308708191},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.496786892414093},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4668114185333252},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45558106899261475},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.4205663800239563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4078402519226074},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3859320878982544},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29075366258621216},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.09920743107795715}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.762872040271759},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7617586851119995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.533503532409668},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5038096308708191},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.496786892414093},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4668114185333252},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45558106899261475},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.4205663800239563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4078402519226074},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3859320878982544},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29075366258621216},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.09920743107795715},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01206317","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01206317","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Complexity","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W42251193","https://openalex.org/W1552517802","https://openalex.org/W1925966619","https://openalex.org/W1976287608","https://openalex.org/W1992185863","https://openalex.org/W1995365759","https://openalex.org/W1997315904","https://openalex.org/W1998919258","https://openalex.org/W2002501531","https://openalex.org/W2029109849","https://openalex.org/W2049016755","https://openalex.org/W2051207661","https://openalex.org/W2060972166","https://openalex.org/W2061987651","https://openalex.org/W2086200341","https://openalex.org/W2123459960","https://openalex.org/W2128703986","https://openalex.org/W2129731249","https://openalex.org/W2156079344","https://openalex.org/W4255155072"],"related_works":["https://openalex.org/W2406030282","https://openalex.org/W2009341260","https://openalex.org/W2952185983","https://openalex.org/W3207053979","https://openalex.org/W3204916073","https://openalex.org/W4387560420","https://openalex.org/W2403507963","https://openalex.org/W2474705870","https://openalex.org/W3046459465","https://openalex.org/W1909384579"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":25},{"year":2019,"cited_by_count":25},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}