{"id":"https://openalex.org/W58544226","doi":"https://doi.org/10.1007/978-3-322-95233-2_15","title":"Communication Complexity and Lower Bounds for Sequential Computation","display_name":"Communication Complexity and Lower Bounds for Sequential Computation","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W58544226","doi":"https://doi.org/10.1007/978-3-322-95233-2_15","mag":"58544226"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-322-95233-2_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-322-95233-2_15","pdf_url":null,"source":{"id":"https://openalex.org/S4210233246","display_name":"Teubner-Texte zur Informatik","issn_l":"1615-4584","issn":["1615-4584"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TEUBNER-TEXTE zur Informatik","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/A5036642435","display_name":"Bala Kalyanasundaram","orcid":null},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bala Kalyanasundaram","raw_affiliation_strings":["Dept. of Computer Science, University of Pittsburgh, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Pittsburgh, USA","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025007932","display_name":"Georg Schnitger","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Georg Schnitger","raw_affiliation_strings":["Dept. of Computer Science, Pennsylvania State University, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Pennsylvania State University, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036642435"],"corresponding_institution_ids":["https://openalex.org/I170201317"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.04385965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"253","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12072","display_name":"Machine Learning and Algorithms","score":0.9955000281333923,"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.9912999868392944,"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/computation","display_name":"Computation","score":0.5872264504432678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5838031768798828},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.387349009513855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33423155546188354}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5872264504432678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5838031768798828},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.387349009513855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33423155546188354}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-322-95233-2_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-322-95233-2_15","pdf_url":null,"source":{"id":"https://openalex.org/S4210233246","display_name":"Teubner-Texte zur Informatik","issn_l":"1615-4584","issn":["1615-4584"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TEUBNER-TEXTE zur Informatik","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W281465961","https://openalex.org/W573171012","https://openalex.org/W1487306589","https://openalex.org/W1513400187","https://openalex.org/W1599370812","https://openalex.org/W1603838866","https://openalex.org/W1967354686","https://openalex.org/W1980223785","https://openalex.org/W1981197081","https://openalex.org/W1986261983","https://openalex.org/W2004213838","https://openalex.org/W2006787007","https://openalex.org/W2008438091","https://openalex.org/W2009798194","https://openalex.org/W2011276482","https://openalex.org/W2014618792","https://openalex.org/W2026348721","https://openalex.org/W2027796826","https://openalex.org/W2045876200","https://openalex.org/W2049016755","https://openalex.org/W2051758697","https://openalex.org/W2062934582","https://openalex.org/W2067002313","https://openalex.org/W2070486524","https://openalex.org/W2075488055","https://openalex.org/W2076331747","https://openalex.org/W2079401865","https://openalex.org/W2080886835","https://openalex.org/W2086814302","https://openalex.org/W2107998050","https://openalex.org/W2125495920","https://openalex.org/W2132750992","https://openalex.org/W2506855370","https://openalex.org/W2573218979","https://openalex.org/W2752853835","https://openalex.org/W2983179306","https://openalex.org/W4253594684","https://openalex.org/W6635866943","https://openalex.org/W6642039570","https://openalex.org/W6651766265","https://openalex.org/W6667001608","https://openalex.org/W6670577890","https://openalex.org/W6674774554","https://openalex.org/W6680864907","https://openalex.org/W6744529318","https://openalex.org/W6758536211","https://openalex.org/W6837107423","https://openalex.org/W6980638228"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2477549100"],"abstract_inverted_index":{"Information-theoretic":[0],"approaches":[1],"for":[2,51,59,85,124],"lower":[3,33,45,57,80,122],"bound":[4],"problems":[5],"are":[6,14,67],"discussed":[7],"and":[8,101,107],"two":[9],"applications":[10],"of":[11,39,64,105,112],"Communication":[12,37,113],"Complexity":[13,38,114],"presented.":[15],"The":[16,89],"first":[17],"application":[18,91],"concerns":[19,92],"one-tape":[20],"Turing":[21,53,61,75],"machines":[22,100,133],"with":[23],"an":[24],"additional":[25],"oneway":[26],"input":[27],"tape.":[28],"It":[29,117],"is":[30,70,115,118],"shown":[31,119],"that":[32,120,130],"bounds":[34,46,58,81,123],"on":[35,47],"the":[36,48,60,102],"a":[40,93],"given":[41,71],"language":[42],"immediately":[43],"imply":[44,129],"running":[49],"time":[50,139],"this":[52,86,125],"machine":[54,62,103],"model.":[55],"Consequently,":[56],"complexity":[63],"specific":[65],"languages":[66],"derived.":[68],"Emphasis":[69],"to":[72],"bounded-error":[73],"probabilistic":[74],"machines,":[76],"since":[77],"no":[78],"previous":[79],"have":[82],"been":[83],"obtained":[84],"computation":[87],"mode.":[88],"second":[90],"real-time":[94],"comparison":[95],"between":[96],"Schoenhage\u2019s":[97],"Storage":[98,131],"Modification":[99,132],"model":[104,111,127],"Kolmogorov":[106],"Uspen-skii.":[108],"A":[109],"non-standard":[110],"defined.":[116],"non-trivial":[121],"communication":[126],"will":[128],"cannot":[134],"be":[135],"simulated":[136],"in":[137],"real":[138],"by":[140],"Kolmogorov-Uspenskii":[141],"machines.":[142]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}