{"id":"https://openalex.org/W1580860198","doi":"https://doi.org/10.1016/s0304-3975(96)00062-x","title":"A comparison of two lower-bound methods for communication complexity","display_name":"A comparison of two lower-bound methods for communication complexity","publication_year":1996,"publication_date":"1996-11-01","ids":{"openalex":"https://openalex.org/W1580860198","doi":"https://doi.org/10.1016/s0304-3975(96)00062-x","mag":"1580860198"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(96)00062-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00062-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5067257613","display_name":"Martin Dietzfelbinger","orcid":"https://orcid.org/0000-0001-5484-3474"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Dietzfelbinger","raw_affiliation_strings":["Fachbereich Informatik, Lehrstuhl II, Universit\u00e4t Dortmund, 44221 Dortmund, Germany","Universit\u00e4t Dortmund"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich Informatik, Lehrstuhl II, Universit\u00e4t Dortmund, 44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Universit\u00e4t Dortmund","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088678782","display_name":"Juraj Hromkovic\u0306","orcid":"https://orcid.org/0000-0001-9754-7042"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]},{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Juraj Hromkovi\u010d","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t zu Kiel, 24098 Kiel, Germany","Universit\u00e4t Paderborn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t zu Kiel, 24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Universit\u00e4t Paderborn","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025007932","display_name":"Georg Schnitger","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]},{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Georg Schnitger","raw_affiliation_strings":["Fachbereich Informatik, Johann Wolfgang Goethe-Universit\u00e4t, 60325 Frankfurt a. M., Germany","Universit\u00e4t Paderborn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich Informatik, Johann Wolfgang Goethe-Universit\u00e4t, 60325 Frankfurt a. M., Germany","institution_ids":["https://openalex.org/I114090438"]},{"raw_affiliation_string":"Universit\u00e4t Paderborn","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5067257613"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":3.8022,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.92362956,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"168","issue":"1","first_page":"39","last_page":"51"},"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.9955000281333923,"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.9955000281333923,"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/T11130","display_name":"Coding theory and cryptography","score":0.995199978351593,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9943000078201294,"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/combinatorics","display_name":"Combinatorics","score":0.7558785080909729},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.7418283820152283},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7374773025512695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6916096210479736},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6601332426071167},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.5741487741470337},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5591743588447571},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5217614769935608},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5099188089370728},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.4443667531013489},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.30583685636520386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10222816467285156}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7558785080909729},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7418283820152283},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7374773025512695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6916096210479736},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6601332426071167},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.5741487741470337},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5591743588447571},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5217614769935608},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5099188089370728},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.4443667531013489},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.30583685636520386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10222816467285156},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(96)00062-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(96)00062-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W97263645","https://openalex.org/W1551614270","https://openalex.org/W1563039933","https://openalex.org/W1603838866","https://openalex.org/W1998090738","https://openalex.org/W2002501531","https://openalex.org/W2009195096","https://openalex.org/W2010730726","https://openalex.org/W2035484943","https://openalex.org/W2060972166","https://openalex.org/W2078003433","https://openalex.org/W2132750992","https://openalex.org/W2163322487","https://openalex.org/W2174446922","https://openalex.org/W2573642654","https://openalex.org/W2913409262","https://openalex.org/W2914643131","https://openalex.org/W3038974689","https://openalex.org/W6633155404","https://openalex.org/W6640352147","https://openalex.org/W6654219356","https://openalex.org/W6665902399","https://openalex.org/W6680510879","https://openalex.org/W6758536211","https://openalex.org/W6758705758"],"related_works":["https://openalex.org/W2106622045","https://openalex.org/W2037737738","https://openalex.org/W4252281389","https://openalex.org/W1991822629","https://openalex.org/W2011175857","https://openalex.org/W3141532631","https://openalex.org/W2061512596","https://openalex.org/W2105128170","https://openalex.org/W2131164334","https://openalex.org/W2558644562"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}