{"id":"https://openalex.org/W1982764719","doi":"https://doi.org/10.1137/s0097539704446220","title":"The Time-Complexity of Local Decision in Distributed Agreement","display_name":"The Time-Complexity of Local Decision in Distributed Agreement","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1982764719","doi":"https://doi.org/10.1137/s0097539704446220","mag":"1982764719"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539704446220","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704446220","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":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/6745","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101852252","display_name":"Partha Sharathi Dutta","orcid":"https://orcid.org/0000-0001-6067-1023"},"institutions":[{"id":"https://openalex.org/I1322087612","display_name":"Alcatel Lucent (Germany)","ror":"https://ror.org/00c5mwp75","country_code":"DE","type":"company","lineage":["https://openalex.org/I1322087612"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Partha Dutta","raw_affiliation_strings":["Bell Labs Research India, Lucent Technologies India Ltd., Bangalore-560095, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Labs Research India, Lucent Technologies India Ltd., Bangalore-560095, India","institution_ids":["https://openalex.org/I1322087612"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049321288","display_name":"Rachid Guerraoui","orcid":"https://orcid.org/0000-0002-4794-8902"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rachid Guerraoui","raw_affiliation_strings":["Distributed Programming Laboratory, EPFL, CH-1015, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Distributed Programming Laboratory, EPFL, CH-1015, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015726068","display_name":"Bastian Pochon","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Bastian Pochon","raw_affiliation_strings":["Distributed Programming Laboratory, EPFL, CH-1015, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Distributed Programming Laboratory, EPFL, CH-1015, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4168,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75467477,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"37","issue":"3","first_page":"722","last_page":"756"},"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.9998999834060669,"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.9998999834060669,"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.9921000003814697,"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/T13553","display_name":"Age of Information Optimization","score":0.9772999882698059,"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.8231074810028076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.584348738193512},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5794947743415833},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.5095953941345215},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4923518896102905},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4734746217727661},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4717187285423279},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4534109830856323},{"id":"https://openalex.org/keywords/uniform-consensus","display_name":"Uniform consensus","score":0.4217434525489807},{"id":"https://openalex.org/keywords/consensus","display_name":"Consensus","score":0.41179633140563965},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36014506220817566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34626322984695435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34325510263442993},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10577434301376343},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.08566385507583618}],"concepts":[{"id":"https://openalex.org/C153180980","wikidata":"https://www.wikidata.org/wiki/Q19776675","display_name":"Commit","level":2,"score":0.8231074810028076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.584348738193512},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5794947743415833},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.5095953941345215},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4923518896102905},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4734746217727661},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4717187285423279},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4534109830856323},{"id":"https://openalex.org/C80966040","wikidata":"https://www.wikidata.org/wiki/Q7885028","display_name":"Uniform consensus","level":4,"score":0.4217434525489807},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.41179633140563965},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36014506220817566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34626322984695435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34325510263442993},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10577434301376343},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.08566385507583618},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539704446220","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704446220","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.68.3691","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.3691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lpdwww.epfl.ch/pdutta/local.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.3835","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.3835","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lpdwww.epfl.ch/pdutta/dgp.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:104306","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/6745","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5124864","host_organization_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","host_organization_lineage":["https://openalex.org/I5124864"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"research article"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:104306","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/6745","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5124864","host_organization_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","host_organization_lineage":["https://openalex.org/I5124864"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"research article"},"sustainable_development_goals":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W26675230","https://openalex.org/W1588792978","https://openalex.org/W1599874886","https://openalex.org/W1721545125","https://openalex.org/W1960553647","https://openalex.org/W1964729314","https://openalex.org/W1988336888","https://openalex.org/W2003214215","https://openalex.org/W2027569465","https://openalex.org/W2034791526","https://openalex.org/W2035362408","https://openalex.org/W2039164882","https://openalex.org/W2058777482","https://openalex.org/W2070941848","https://openalex.org/W2075854425","https://openalex.org/W2091004544","https://openalex.org/W2092431596","https://openalex.org/W2096238022","https://openalex.org/W2101712143","https://openalex.org/W2106887953","https://openalex.org/W2126924915","https://openalex.org/W2130545950","https://openalex.org/W2133943294","https://openalex.org/W2155168782","https://openalex.org/W2569772192","https://openalex.org/W2611515161","https://openalex.org/W2707263665","https://openalex.org/W3137092842"],"related_works":["https://openalex.org/W1788591815","https://openalex.org/W4229449431","https://openalex.org/W2112337480","https://openalex.org/W2166189192","https://openalex.org/W2106670435","https://openalex.org/W2017057923","https://openalex.org/W2148488729","https://openalex.org/W2783501646","https://openalex.org/W2168796223","https://openalex.org/W1979834611"],"abstract_inverted_index":{"Agreement":[0],"is":[1,36,232,263,282],"at":[2,85],"the":[3,26,42,66,78,102,119,127,132,182,188,193,204,238,258,264,267],"heart":[4],"of":[5,16,25,32,41,44,68,80,105,114,118,123,146,195,218,240,249],"distributed":[6,33],"computing.":[7],"In":[8],"its":[9],"simple":[10],"form,":[11],"it":[12],"requires":[13],"a":[14,21,50,61,111,244,254,275],"set":[15],"processes":[17,58],"to":[18,48,59,90,159,242],"decide":[19],"on":[20,101],"common":[22],"value":[23],"out":[24,117],"values":[27],"they":[28,177],"propose.":[29],"The":[30],"time-complexity":[31,67,194],"agreement":[34,72],"problems":[35],"generally":[37],"measured":[38],"in":[39,71,110,246],"terms":[40],"number":[43,79,103,121,239],"communication":[45,81],"rounds":[46,82,241],"needed":[47,83],"achieve":[49],"global":[51,172,269],"decision,":[52],"i.e.,":[53],"for":[54,84,95,143,163,215],"all":[55],"nonfaulty":[56],"(correct)":[57],"reach":[60,243],"decision.":[62],"This":[63],"paper":[64],"studies":[65],"local":[69,97,140,165,212,260],"decisions":[70],"problems,":[73],"which":[74],"we":[75,137,202,209],"define":[76],"as":[77,266],"least":[86],"one":[87,235],"correct":[88],"process":[89],"decide.":[91],"We":[92,129,155,252,272],"explore":[93],"bounds":[94,142,167,174,214],"early":[96,259,268,277],"decision":[98,141,166,173,213,245,261,270],"that":[99,257,281],"depend":[100],"f":[104],"actual":[106],"failures":[107,124],"(that":[108],"occur":[109],"given":[112],"run":[113],"an":[115],"algorithm),":[116,184],"maximum":[120],"t":[122],"tolerated":[125],"(by":[126],"algorithm).":[128],"first":[130,189],"consider":[131,203],"synchronous":[133,206,216,288],"message-passing":[134],"model":[135],"where":[136,208],"give":[138,210,274],"tight":[139,211],"three":[144],"variants":[145],"agreement:":[147],"consensus,":[148,150,164],"uniform":[149,196,219,226],"and":[151,185,198,225,234],"(nonblocking)":[152],"atomic":[153,199,230],"commit.":[154,200],"use":[156],"these":[157],"results":[158],"(1)":[160],"show":[161],"that,":[162],"are":[168,228],"not":[169],"compatible":[170],"with":[171],"(roughly":[175],"speaking,":[176],"cannot":[178,236],"be":[179],"reached":[180],"by":[181],"same":[183,265],"(2)":[186],"draw":[187],"sharp":[190],"line":[191],"between":[192],"consensus":[197,224,227,250,279,289],"Then":[201],"eventually":[205,287],"model,":[207,223],"runs":[217,248],"consensus.":[220],"(In":[221],"this":[222],"similar,":[229],"commit":[231],"impossible,":[233],"bound":[237,262],"nonsynchronous":[247],"algorithms.)":[251],"prove":[253],"counterintuitive":[255],"result":[256],"bound.":[271],"also":[273],"matching":[276],"deciding":[278],"algorithm":[280],"significantly":[283],"better":[284],"than":[285],"previous":[286],"algorithms.":[290]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2025-10-10T00:00:00"}