{"id":"https://openalex.org/W2003007405","doi":"https://doi.org/10.1137/0221052","title":"Determinism vs. Nondeterminism in Multiparty Communication Complexity","display_name":"Determinism vs. Nondeterminism in Multiparty Communication Complexity","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W2003007405","doi":"https://doi.org/10.1137/0221052","mag":"2003007405"},"language":"en","primary_location":{"id":"doi:10.1137/0221052","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221052","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5013225896","display_name":"Danny Dolev","orcid":"https://orcid.org/0000-0001-8853-0644"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Danny Dolev","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109192583","display_name":"Tom\u00e1s Feder","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom\u00e1s Feder","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013225896"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.11877228,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"5","first_page":"889","last_page":"895"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9828000068664551,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9828000068664551,"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/T12029","display_name":"DNA and Biological Computing","score":0.9652000069618225,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9580000042915344,"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/determinism","display_name":"Determinism","score":0.7460322380065918},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6334158182144165},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5618624091148376},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5552993416786194},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4510093629360199},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28121280670166016},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.1032240092754364},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.0778357982635498}],"concepts":[{"id":"https://openalex.org/C192183473","wikidata":"https://www.wikidata.org/wiki/Q131133","display_name":"Determinism","level":2,"score":0.7460322380065918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6334158182144165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5618624091148376},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5552993416786194},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4510093629360199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28121280670166016},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.1032240092754364},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0778357982635498}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0221052","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221052","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.1533","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.1533","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.huji.ac.il/~dolev/pubs/determinism.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2016606569","https://openalex.org/W2026325622","https://openalex.org/W2035038579","https://openalex.org/W2069919161","https://openalex.org/W2094321606"],"related_works":["https://openalex.org/W1994916325","https://openalex.org/W49472806","https://openalex.org/W2556081204","https://openalex.org/W4210355121","https://openalex.org/W2027620237","https://openalex.org/W1968633117","https://openalex.org/W2407924029","https://openalex.org/W2762284079","https://openalex.org/W1506049346","https://openalex.org/W1142610210"],"abstract_inverted_index":{"A":[0],"given":[1,69],"Boolean":[2,47],"function":[3,31,48],"has":[4],"its":[5],"input":[6],"distributed":[7],"among":[8],"many":[9],"parties.":[10],"The":[11],"aim":[12],"is":[13,42],"to":[14,18,20,24,28,44,64],"determine":[15],"which":[16],"parties":[17,60],"talk":[19],"and":[21,57],"what":[22],"information":[23,66],"exchange":[25],"in":[26,55],"order":[27],"evaluate":[29,45],"the":[30,34,46,65,71,76],"while":[32],"minimizing":[33],"total":[35],"communication.":[36],"This":[37],"paper":[38],"shows":[39],"that":[40],"it":[41],"possible":[43],"deterministically":[49],"with":[50,62],"only":[51],"a":[52],"polynomial":[53],"increase":[54],"communication":[56,73],"number":[58],"of":[59,75],"accessed":[61],"respect":[63],"lower":[67],"bound":[68],"by":[70],"nondeterministic":[72],"complexity":[74],"function.":[77]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}