{"id":"https://openalex.org/W2122491152","doi":"https://doi.org/10.1145/1060590.1060696","title":"From a static impossibility to an adaptive lower bound","display_name":"From a static impossibility to an adaptive lower bound","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W2122491152","doi":"https://doi.org/10.1145/1060590.1060696","mag":"2122491152"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060696","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/64476","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":[{"id":"https://openalex.org/I2799798094","display_name":"UCLA Health","ror":"https://ror.org/01d88se56","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I2799798094"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eli Gafni","raw_affiliation_strings":["UCLA","UCLA ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UCLA","institution_ids":["https://openalex.org/I2799798094"]},{"raw_affiliation_string":"UCLA ,","institution_ids":["https://openalex.org/I2799798094"]}]},{"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":["EPFL","School of Computer and Communication Sciences EPFL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL","institution_ids":[]},{"raw_affiliation_string":"School of Computer and Communication Sciences EPFL","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015726068","display_name":"Bastian Pochon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bastian Pochon","raw_affiliation_strings":["EPFL","School of Computer and Communication Sciences EPFL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL","institution_ids":[]},{"raw_affiliation_string":"School of Computer and Communication Sciences EPFL","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7517,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.92048856,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"714","last_page":"722"},"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.980400025844574,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9790999889373779,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.847143828868866},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.7680023312568665},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7512001991271973},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.693767786026001},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6306824684143066},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.606856644153595},{"id":"https://openalex.org/keywords/asynchronous-system","display_name":"Asynchronous system","score":0.5528464317321777},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5451331734657288},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.5339573621749878},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5123168230056763},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.45292770862579346},{"id":"https://openalex.org/keywords/asynchrony","display_name":"Asynchrony (computer programming)","score":0.43288007378578186},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40328776836395264},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32050615549087524},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17666450142860413},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10591349005699158},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09053832292556763}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.847143828868866},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.7680023312568665},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7512001991271973},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.693767786026001},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6306824684143066},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.606856644153595},{"id":"https://openalex.org/C7923308","wikidata":"https://www.wikidata.org/wiki/Q4812211","display_name":"Asynchronous system","level":5,"score":0.5528464317321777},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5451331734657288},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.5339573621749878},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5123168230056763},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.45292770862579346},{"id":"https://openalex.org/C2779019669","wikidata":"https://www.wikidata.org/wiki/Q25203946","display_name":"Asynchrony (computer programming)","level":3,"score":0.43288007378578186},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40328776836395264},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32050615549087524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17666450142860413},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10591349005699158},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09053832292556763},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0},{"id":"https://openalex.org/C137059387","wikidata":"https://www.wikidata.org/wiki/Q426882","display_name":"Clock signal","level":3,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C42196554","wikidata":"https://www.wikidata.org/wiki/Q1186179","display_name":"Synchronous circuit","level":4,"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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1060590.1060696","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.tind.io:64476","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/64476","pdf_url":"http://infoscience.epfl.ch/record/64476","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":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:64476","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/64476","pdf_url":"http://infoscience.epfl.ch/record/64476","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":"conference proceedings"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2122491152.pdf"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1967858331","https://openalex.org/W1967980352","https://openalex.org/W1981017197","https://openalex.org/W1984340066","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/W2107834524","https://openalex.org/W2135527852","https://openalex.org/W2149907923","https://openalex.org/W2611515161","https://openalex.org/W7056210342"],"related_works":["https://openalex.org/W2944915449","https://openalex.org/W2102266661","https://openalex.org/W2122229220","https://openalex.org/W4283014255","https://openalex.org/W4312516786","https://openalex.org/W2129978639","https://openalex.org/W2362759320","https://openalex.org/W2279224052","https://openalex.org/W2545105736","https://openalex.org/W1647623034"],"abstract_inverted_index":{"Set":[0],"agreement,":[1,115],"where":[2,17],"processors":[3],"decisions":[4,19],"constitute":[5],"a":[6,23,108,124,144,206,242,247,254],"set":[7,34,45,64,114,213],"of":[8,50,62,68,78,95,120,133,139,166,173,181,184,269],"outputs,":[9],"is":[10,27,84,170,253],"notoriously":[11],"harder":[12],"to":[13,22,73,91,126,129,149,153,175,187,209,220,240,257],"analyze":[14],"than":[15],"consensus":[16],"the":[18,29,48,51,60,66,74,118,130,156,167,171,179,185,222,228,232,267],"are":[20,36,100],"restricted":[21],"single":[24],"output.":[25],"This":[26,251],"because":[28],"topological":[30,69,151,260],"questions":[31],"that":[32,77,147,159],"underly":[33],"agreement":[35,46],"not":[37,85,196],"about":[38],"simple":[39,244,255],"connectivity":[40],"as":[41],"in":[42,116,136,231,263],"consensus.":[43],"Analyzing":[44],"inspired":[47],"discovery":[49],"relation":[52],"between":[53],"topology":[54],"and":[55,58,80,204,262],"distributed":[56],"algorithms,":[57],"consequently":[59],"impossibility":[61],"asynchronous":[63,79,249],"agreement.Yet,":[65],"application":[67],"reasoning":[70],"has":[71],"been":[72],"static":[75,248],"case,":[76],"synchronous":[81,113,210],"tasks.":[82,97],"It":[83],"known":[86],"yet":[87,258],"for":[88],"example,":[89],"how":[90],"characterize":[92],"starvation-free":[93],"solvability":[94],"non-terminating":[96],"Non-terminating":[98],"tasks":[99],"dynamic":[101,140,157],"entities":[102],"with":[103,155,161],"no":[104],"defined":[105],"end.":[106],"In":[107],"similar":[109],"vain,":[110],"early":[111,162,211],"deciding":[112],"which":[117],"number":[119,132],"rounds":[121,183],"it":[122,236],"takes":[123],"processor":[125],"decide":[127],"adapts":[128],"actual":[131],"failures,":[134],"falls":[135],"this":[137],"category":[138],"entities.This":[141],"paper":[142],"develops":[143],"simulation":[145,169,186],"technique":[146,226],"brings":[148],"bear":[150],"results":[152],"deal":[154],"situation":[158],"arises":[160],"decisions.":[163],"The":[164],"novelty":[165],"new":[168,193],"ability":[172],"simulators":[174],"look":[176],"back":[177],"at":[178],"transcript":[180],"past":[182,199],"influence":[188],"their":[189],"current":[190],"behavior.Using":[191],"our":[192],"technique,":[194],"we":[195,202],"only":[197],"re-derive":[198],"results,":[200],"but":[201],"propose":[203],"prove":[205],"lower":[207,223],"bound":[208],"stopping":[212],"agreement.":[214],"We":[215],"then":[216],"provide":[217],"an":[218,272],"algorithm":[219],"match":[221],"bound.":[224],"Our":[225],"uses":[227],"BG":[229],"simulation,":[230],"most":[233],"creative":[234],"way":[235,268],"was":[237],"used":[238],"to-date,":[239],"obtain":[241],"rather":[243],"reduction":[245,252],"from":[246],"impossibility.":[250],"alternative":[256],"unknown":[259],"argument,":[261],"fact":[264],"may":[265],"suggest":[266],"finding":[270],"such":[271],"argument.":[273]},"counts_by_year":[{"year":2016,"cited_by_count":3}],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2025-10-10T00:00:00"}