{"id":"https://openalex.org/W2053469355","doi":"https://doi.org/10.1137/050640746","title":"The Complexity of Early Deciding Set Agreement","display_name":"The Complexity of Early Deciding Set Agreement","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2053469355","doi":"https://doi.org/10.1137/050640746","mag":"2053469355"},"language":"en","primary_location":{"id":"doi:10.1137/050640746","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050640746","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":"http://infoscience.epfl.ch/record/171702","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031972040","display_name":"Eli Gafni","orcid":"https://orcid.org/0009-0008-6799-2784"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eli Gafni","raw_affiliation_strings":["eli@cs.ucla.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"eli@cs.ucla.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049321288","display_name":"Rachid Guerraoui","orcid":"https://orcid.org/0000-0002-4794-8902"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rachid Guerraoui","raw_affiliation_strings":["rachid.guerraoui@epfl.ch and bastian.pochon@gmail.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"rachid.guerraoui@epfl.ch and bastian.pochon@gmail.com#TAB#","institution_ids":[]}]},{"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":["School of Computer and Communication Sciences, EPFL, 1015 Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences, EPFL, 1015 Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8089,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90968059,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"40","issue":"1","first_page":"63","last_page":"78"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9790999889373779,"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/T10142","display_name":"Formal Methods in Verification","score":0.9771999716758728,"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/asynchronous-communication","display_name":"Asynchronous communication","score":0.7594317197799683},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7323617339134216},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.6996299028396606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6489863991737366},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6026301383972168},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.5521612167358398},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.5410493612289429},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5037264227867126},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4492635726928711},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44786423444747925},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4286406934261322},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4231502413749695},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3845033347606659},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.304867684841156},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2905006408691406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2812895178794861},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.244896799325943},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10253414511680603}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7594317197799683},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7323617339134216},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.6996299028396606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6489863991737366},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6026301383972168},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.5521612167358398},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.5410493612289429},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5037264227867126},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4492635726928711},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44786423444747925},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4286406934261322},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4231502413749695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3845033347606659},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.304867684841156},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2905006408691406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2812895178794861},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.244896799325943},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10253414511680603},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/050640746","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050640746","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:infoscience.epfl.ch:171702","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/171702","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:infoscience.tind.io:171702","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/74407","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:171702","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/171702","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"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":18,"referenced_works":["https://openalex.org/W1967980352","https://openalex.org/W1981017197","https://openalex.org/W1993805917","https://openalex.org/W2016269200","https://openalex.org/W2024624176","https://openalex.org/W2027569465","https://openalex.org/W2035362408","https://openalex.org/W2036265926","https://openalex.org/W2039164882","https://openalex.org/W2053113612","https://openalex.org/W2056910803","https://openalex.org/W2058777482","https://openalex.org/W2075601083","https://openalex.org/W2083306187","https://openalex.org/W2122491152","https://openalex.org/W2135527852","https://openalex.org/W2149907923","https://openalex.org/W2611515161"],"related_works":["https://openalex.org/W4243844743","https://openalex.org/W3208184694","https://openalex.org/W2498758832","https://openalex.org/W4233541614","https://openalex.org/W1578042825","https://openalex.org/W3163622116","https://openalex.org/W2146401083","https://openalex.org/W2792172447","https://openalex.org/W4287181807","https://openalex.org/W2366325093"],"abstract_inverted_index":{"In":[0,115],"the":[1,38,142,150],"k-set":[2,88],"agreement":[3,89,147],"problem,":[4],"each":[5],"processor":[6],"starts":[7],"with":[8],"a":[9,43,51,81,84,162,167,171],"private":[10],"input":[11],"value":[12,33],"and":[13,29,48,105],"eventually":[14],"decides":[15],"on":[16,121],"an":[17,94,156],"output":[18,24,32],"value.":[19],"At":[20],"most":[21,71],"k":[22],"distinct":[23],"values":[25],"may":[26,103],"be":[27,35,110],"chosen,":[28],"every":[30,66],"processor's":[31],"must":[34],"one":[36],"of":[37,54,58,83,144],"proposed":[39],"values.":[40],"We":[41,153],"consider":[42],"synchronous":[44,85],"message":[45,91,163],"passing":[46,164],"system,":[47],"we":[49],"prove":[50],"tight":[52],"bound":[53,77,126,160],"$\\lfloor":[55],"f/k\\rfloor+2$":[56],"rounds":[57],"communication":[59],"for":[60,161],"all":[61],"processors":[62,73,102],"to":[63,87,109,117,148],"decide":[64],"in":[65,68,90,93,99,170],"run":[67],"which":[69,100,106],"at":[70],"f":[72],"fail.":[74],"The":[75],"lower":[76,125,159],"proof":[78,127],"proceeds":[79],"through":[80],"simulation":[82],"solution":[86],"passing,":[92],"asynchronous":[95,145],"shared":[96,172],"memory":[97,173],"system":[98,165],"$k-1$":[101],"fail,":[104],"was":[107],"proven":[108],"impossible":[111],"using":[112],"topological":[113,137],"approaches.":[114],"contrast":[116],"past":[118],"complexity":[119,158],"results":[120],"set":[122,146],"agreement,":[123],"our":[124],"is":[128],"purely":[129],"algorithmic.":[130],"It":[131],"does":[132],"not":[133],"use":[134],"any":[135],"direct":[136],"argument":[138],"but":[139],"uses":[140],"instead":[141],"impossibility":[143,169],"encapsulate":[149],"needed":[151],"topology.":[152],"thus":[154],"derive":[155],"adaptive":[157],"from":[166],"static":[168],"system.":[174]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2025-10-10T00:00:00"}