{"id":"https://openalex.org/W1980223785","doi":"https://doi.org/10.1137/0405044","title":"The Probabilistic Communication Complexity of Set Intersection","display_name":"The Probabilistic Communication Complexity of Set Intersection","publication_year":1992,"publication_date":"1992-11-01","ids":{"openalex":"https://openalex.org/W1980223785","doi":"https://doi.org/10.1137/0405044","mag":"1980223785"},"language":"en","primary_location":{"id":"doi:10.1137/0405044","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0405044","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5036642435","display_name":"Bala Kalyanasundaram","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bala Kalyanasundaram","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075345183","display_name":"Georg Schintger","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Georg Schintger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3912,"has_fulltext":false,"cited_by_count":459,"citation_normalized_percentile":{"value":0.87888274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"5","issue":"4","first_page":"545","last_page":"557"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9955000281333923,"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/T11567","display_name":"semigroups and automata theory","score":0.995199978351593,"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/intersection","display_name":"Intersection (aeronautics)","score":0.879564642906189},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.843957781791687},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7280693054199219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6650333404541016},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6546304225921631},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5966085195541382},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5823871493339539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5527264475822449},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5341870784759521},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.48407021164894104},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42746275663375854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34401094913482666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2741040587425232},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06820270419120789}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.879564642906189},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.843957781791687},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7280693054199219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6650333404541016},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6546304225921631},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5966085195541382},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5823871493339539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5527264475822449},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5341870784759521},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.48407021164894104},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42746275663375854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34401094913482666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2741040587425232},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06820270419120789},{"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0405044","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0405044","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1599370812","https://openalex.org/W2014618792","https://openalex.org/W2042587503","https://openalex.org/W2082036845"],"related_works":["https://openalex.org/W2963903795","https://openalex.org/W2008470896","https://openalex.org/W4377371889","https://openalex.org/W3119911731","https://openalex.org/W1673132890","https://openalex.org/W2952190127","https://openalex.org/W3109861677","https://openalex.org/W2113623403","https://openalex.org/W2027214648","https://openalex.org/W4295288333"],"abstract_inverted_index":{"It":[0],"is":[1,18,49,66],"shown":[2],"that,":[3],"for":[4],"inputs":[5],"of":[6,15,63],"length":[7],"n,":[8],"the":[9,37,50,59],"probabilistic":[10,60],"(bounded":[11],"error)":[12],"communication":[13,61],"complexity":[14,62],"set":[16,24],"intersection":[17,25],"$\\Theta":[19],"(":[20],"n":[21,34],")$.":[22],"Since":[23],"can":[26],"be":[27],"recognized":[28],"nondeterministically":[29],"by":[30],"exchanging":[31],"$O(":[32],"\\log":[33],")$":[35],"bits,":[36],"result":[38],"implies":[39],"an":[40],"exponential":[41],"gap":[42,48],"between":[43],"nondeterminism":[44],"and":[45],"probabilism.":[46],"This":[47],"largest":[51],"possible.":[52],"The":[53],"first":[54],"general":[55],"technique":[56],"to":[57],"analyze":[58],"sparse":[64],"languages":[65],"also":[67],"described.":[68]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":48},{"year":2019,"cited_by_count":23},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":25},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":23},{"year":2013,"cited_by_count":28},{"year":2012,"cited_by_count":32}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}