{"id":"https://openalex.org/W1590593970","doi":"https://doi.org/10.1007/3-540-56939-1_76","title":"Lower bounds for one-way probabilistic communication complexity","display_name":"Lower bounds for one-way probabilistic communication complexity","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W1590593970","doi":"https://doi.org/10.1007/3-540-56939-1_76","mag":"1590593970"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-56939-1_76","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-56939-1_76","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","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/A5009862855","display_name":"Farid Ablayev","orcid":"https://orcid.org/0000-0002-5592-3211"},"institutions":[{"id":"https://openalex.org/I21203515","display_name":"Kazan Federal University","ror":"https://ror.org/05256ym39","country_code":"RU","type":"education","lineage":["https://openalex.org/I21203515"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Farid Ablayev","raw_affiliation_strings":["Department of Theoretical Cybernetics, Kazan University, 420008, Kazan, Russia","Kazan University"],"affiliations":[{"raw_affiliation_string":"Department of Theoretical Cybernetics, Kazan University, 420008, Kazan, Russia","institution_ids":["https://openalex.org/I21203515"]},{"raw_affiliation_string":"Kazan University","institution_ids":["https://openalex.org/I21203515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009862855"],"corresponding_institution_ids":["https://openalex.org/I21203515"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.2503,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.87270156,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9965999722480774,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.9091883301734924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7091242074966431},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.705437958240509},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6804412007331848},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.6230669617652893},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5533791780471802},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5328056812286377},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.47800055146217346},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43916356563568115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39069241285324097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36233988404273987},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2992347776889801},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10761144757270813}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.9091883301734924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7091242074966431},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.705437958240509},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6804412007331848},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.6230669617652893},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5533791780471802},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5328056812286377},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.47800055146217346},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43916356563568115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39069241285324097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36233988404273987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2992347776889801},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10761144757270813},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-56939-1_76","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-56939-1_76","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.4555","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.4555","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.rochester.edu/pub/papers/theory/92.tr422.probabilistic_commun_complexity.ps.Z","raw_type":"text"},{"id":"pmh:oai:urresearch.rochester.edu:439","is_oa":false,"landing_page_url":"http://hdl.handle.net/1802/586","pdf_url":null,"source":{"id":"https://openalex.org/S4306400518","display_name":"UR Research (University of Rochester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5388228","host_organization_name":"University of Rochester","host_organization_lineage":["https://openalex.org/I5388228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W192892485","https://openalex.org/W1563039933","https://openalex.org/W1590593970","https://openalex.org/W1594335079","https://openalex.org/W1603838866","https://openalex.org/W1830022383","https://openalex.org/W2002501531","https://openalex.org/W2006787007","https://openalex.org/W2008671796","https://openalex.org/W2082036845","https://openalex.org/W2086239097","https://openalex.org/W2093303125","https://openalex.org/W2123750718","https://openalex.org/W2151303208","https://openalex.org/W2174130830","https://openalex.org/W2296545821","https://openalex.org/W2913409262","https://openalex.org/W4212875940"],"related_works":["https://openalex.org/W3212703233","https://openalex.org/W1513451900","https://openalex.org/W4288641573","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2130100567","https://openalex.org/W2328371232","https://openalex.org/W2011403573","https://openalex.org/W1499116563","https://openalex.org/W1574530675"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}