{"id":"https://openalex.org/W2093534044","doi":"https://doi.org/10.1137/0220027","title":"The Communication Complexity of Atomic Commitment and of Gossiping","display_name":"The Communication Complexity of Atomic Commitment and of Gossiping","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W2093534044","doi":"https://doi.org/10.1137/0220027","mag":"2093534044"},"language":"en","primary_location":{"id":"doi:10.1137/0220027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220027","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.7916/d8vt215g","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036650099","display_name":"Ouri Wolfson","orcid":"https://orcid.org/0000-0002-1794-0109"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ouri Wolfson","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Chicago,#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Chicago,#TAB#","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109858858","display_name":"Adrian Segall","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adrian Segall","raw_affiliation_strings":["Columbia University"],"affiliations":[{"raw_affiliation_string":"Columbia University","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036650099"],"corresponding_institution_ids":["https://openalex.org/I39422238"],"apc_list":null,"apc_paid":null,"fwci":2.8673,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.91133417,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"3","first_page":"423","last_page":"450"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9574999809265137,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/commit","display_name":"Commit","score":0.8219689130783081},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7186489105224609},{"id":"https://openalex.org/keywords/gossip","display_name":"Gossip","score":0.6797706484794617},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6199870705604553},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.579181432723999},{"id":"https://openalex.org/keywords/two-phase-commit-protocol","display_name":"Two-phase commit protocol","score":0.527445375919342},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5031034350395203},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48565852642059326},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4421137869358063},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4156273603439331},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39120492339134216},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.3889976441860199},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3775099813938141},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33067864179611206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32474255561828613},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23029842972755432},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18741485476493835},{"id":"https://openalex.org/keywords/distributed-transaction","display_name":"Distributed transaction","score":0.17590677738189697},{"id":"https://openalex.org/keywords/transaction-processing","display_name":"Transaction processing","score":0.10150879621505737},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.08316868543624878},{"id":"https://openalex.org/keywords/psychology","display_name":"Psychology","score":0.08195191621780396}],"concepts":[{"id":"https://openalex.org/C153180980","wikidata":"https://www.wikidata.org/wiki/Q19776675","display_name":"Commit","level":2,"score":0.8219689130783081},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7186489105224609},{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.6797706484794617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6199870705604553},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.579181432723999},{"id":"https://openalex.org/C111009948","wikidata":"https://www.wikidata.org/wiki/Q1067690","display_name":"Two-phase commit protocol","level":5,"score":0.527445375919342},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5031034350395203},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48565852642059326},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4421137869358063},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4156273603439331},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39120492339134216},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.3889976441860199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3775099813938141},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33067864179611206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32474255561828613},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23029842972755432},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18741485476493835},{"id":"https://openalex.org/C25185021","wikidata":"https://www.wikidata.org/wiki/Q4053284","display_name":"Distributed transaction","level":4,"score":0.17590677738189697},{"id":"https://openalex.org/C72108876","wikidata":"https://www.wikidata.org/wiki/Q844565","display_name":"Transaction processing","level":3,"score":0.10150879621505737},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08316868543624878},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.08195191621780396},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/0220027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220027","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.903.2633","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.903.2633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://academiccommons.columbia.edu/download/fedora_content/download/ac%3A143542/CONTENT/cucs-499-89.pdf","raw_type":"text"},{"id":"pmh:oai:academiccommons.columbia.edu:10.7916/D8VT215G","is_oa":false,"landing_page_url":"https://doi.org/10.7916/D8VT215G","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Reports"},{"id":"doi:10.7916/d8vt215g","is_oa":true,"landing_page_url":"https://doi.org/10.7916/d8vt215g","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.7916/d8vt215g","is_oa":true,"landing_page_url":"https://doi.org/10.7916/d8vt215g","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W155027859","https://openalex.org/W170193145","https://openalex.org/W1545155892","https://openalex.org/W1552521662","https://openalex.org/W1721545125","https://openalex.org/W1975039515","https://openalex.org/W2030451690","https://openalex.org/W2052504823","https://openalex.org/W2058322021","https://openalex.org/W2063671599","https://openalex.org/W2070941848","https://openalex.org/W2169379483","https://openalex.org/W2340365916","https://openalex.org/W3137220996"],"related_works":["https://openalex.org/W2088991932","https://openalex.org/W4297564856","https://openalex.org/W2126986415","https://openalex.org/W2575658272","https://openalex.org/W2142572717","https://openalex.org/W2188959420","https://openalex.org/W2113394194","https://openalex.org/W3013456162","https://openalex.org/W2953048275","https://openalex.org/W1953135125"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,5,18,26,31,51,72,77,117,133,162,196,212],"atomic":[3,44,66],"commitment":[4,45,67],"a":[6,9,16,24,52,70,120,136,152,171],"transaction":[7],"in":[8,102,114,130],"distributed":[10,175],"database":[11],"is":[12,15,35,47,92,107,125,146,168,182,193,198,202,206],"considered.":[13],"This":[14,57],"variant":[17],"the":[19,38,49,60,81,103,115,131,160,188,194,209,213],"famous":[20],"gossiping":[21],"problem.":[22],"Given":[23],"set":[25,71],"communication":[27,40,62,73,122,138,154,163,166,180],"costs":[28],"between":[29,75],"pairs":[30,76],"participant":[32,78,86],"sites,":[33,79],"it":[34,91,201],"established":[36],"that":[37,94,204],"necessary":[39,61],"cost":[41,50,164],"for":[42,64,158],"any":[43,65],"algorithm":[46,112,128,149],"twice":[48],"certain":[53],"minimum":[54,121,137,153,189],"spanning":[55],"tree.":[56],"paper":[58],"establishes":[59],"time":[63,82,167],"algorithm,":[68,176],"given":[69],"delays":[74],"and":[80,165],"at":[83],"which":[84,150,159],"each":[85],"completes":[87],"its":[88],"subtransaction.":[89],"Then,":[90],"determined":[93],"both":[95],"lower":[96],"bounds":[97,101],"are":[98],"also":[99],"upper":[100],"following":[104],"sense.":[105],"There":[106,124],"an":[108],"efficient":[109,127,148],"(i.e.,":[110],"polynomial-time)":[111],"that,":[113,129],"absence":[116,132],"failures,":[118,134],"has":[119,135,151],"cost.":[123],"another":[126],"time.":[139],"However,":[140],"unless":[141],"P":[142],"=":[143],"NP,":[144],"there":[145],"no":[147],"complexity,":[155,190],"namely,":[156],"one":[157],"product":[161],"minimum.":[169],"Next,":[170],"simple,":[172],"linear":[173],"time,":[174],"called":[177],"TREE-COMMIT,":[178],"whose":[179],"complexity":[181],"not":[183],"worse":[184],"than":[185],"p":[186,192],"times":[187],"where":[191],"number":[195],"participants,":[197],"presented.":[199],"Finally,":[200],"demonstrated":[203],"TREE-COMMIT":[205],"superior":[207],"to":[208],"existing":[210],"variants":[211],"two-phase":[214],"commit":[215],"protocol.":[216]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}