{"id":"https://openalex.org/W3185005036","doi":"https://doi.org/10.1145/3465084.3467949","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3185005036","doi":"https://doi.org/10.1145/3465084.3467949","mag":"3185005036"},"language":"en","primary_location":{"id":"doi:10.1145/3465084.3467949","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-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/A5006344213","display_name":"Manish Kumar","orcid":"https://orcid.org/0000-0002-0414-7910"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Manish Kumar","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018807670","display_name":"Anisur Rahaman Molla","orcid":"https://orcid.org/0000-0002-1537-3462"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anisur Rahaman Molla","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006344213"],"corresponding_institution_ids":["https://openalex.org/I6498739"],"apc_list":null,"apc_paid":null,"fwci":0.7641,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73089506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"259","last_page":"262"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9941999912261963,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9940000176429749,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.689179539680481},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.6553474068641663},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6428893208503723},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.5843138098716736},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5838154554367065},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5569314956665039},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5506266951560974},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5280355215072632},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4661738872528076},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4586195647716522},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.446347177028656},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.4457658529281616},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.44288286566734314},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4319894313812256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4198196232318878},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.41285815834999084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3810974359512329},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31313297152519226},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3078373670578003},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1681312918663025}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.689179539680481},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.6553474068641663},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6428893208503723},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.5843138098716736},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5838154554367065},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5569314956665039},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5506266951560974},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5280355215072632},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4661738872528076},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4586195647716522},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.446347177028656},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.4457658529281616},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.44288286566734314},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4319894313812256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4198196232318878},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.41285815834999084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3810974359512329},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31313297152519226},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3078373670578003},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1681312918663025},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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":1,"locations":[{"id":"doi:10.1145/3465084.3467949","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1498909462","https://openalex.org/W1526359699","https://openalex.org/W1564320112","https://openalex.org/W1568961751","https://openalex.org/W1595409123","https://openalex.org/W1600328410","https://openalex.org/W1964052655","https://openalex.org/W1974895073","https://openalex.org/W1976986662","https://openalex.org/W1986330160","https://openalex.org/W2008636585","https://openalex.org/W2011933679","https://openalex.org/W2020377431","https://openalex.org/W2024606983","https://openalex.org/W2037610055","https://openalex.org/W2042437235","https://openalex.org/W2069689700","https://openalex.org/W2071043548","https://openalex.org/W2073543119","https://openalex.org/W2073730996","https://openalex.org/W2088374619","https://openalex.org/W2091422818","https://openalex.org/W2126924915","https://openalex.org/W2136604606","https://openalex.org/W2143149536","https://openalex.org/W2163059190","https://openalex.org/W2167898414","https://openalex.org/W2169349386","https://openalex.org/W2611515161","https://openalex.org/W2810304763","https://openalex.org/W2899702797","https://openalex.org/W2952871158","https://openalex.org/W2984248984","https://openalex.org/W3034372928","https://openalex.org/W3137092842","https://openalex.org/W3162105941","https://openalex.org/W4205300528","https://openalex.org/W4249610293"],"related_works":["https://openalex.org/W2007715402","https://openalex.org/W3097369619","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W2069689700","https://openalex.org/W2946052740","https://openalex.org/W3185005036","https://openalex.org/W4380875831","https://openalex.org/W78560857","https://openalex.org/W4317672243"],"abstract_inverted_index":{"This":[0],"paper":[1,237],"investigates":[2],"on":[3,39],"the":[4,8,18,31,40,44,49,115,128,236],"message":[5,41,56,136],"complexity":[6,57,126,137],"of":[7,48,65,127,154,211,235],"two":[9,50],"fundamental":[10],"problems,":[11,51],"namely,":[12],"leader":[13,88,94,161],"election":[14,89,162],"and":[15,21,33,114,135,171,192,227],"agreement":[16,186,218],"in":[17,71,98,105,187],"crash-fault":[19],"synchronous":[20],"fully-connected":[22],"distributed":[23],"network.":[24],"We":[25],"present":[26],"randomized":[27,87,177],"algorithms":[28,53,69],"for":[29,159,216],"both":[30],"problems":[32],"also":[34],"develop":[35],"non-trivial":[36,151],"lower":[37,152,203],"bounds":[38],"complexity.":[42],"In":[43],"so-called":[45],"implicit":[46],"version":[47,234],"our":[52,82],"achieve":[54],"sublinear":[55],"while":[58],"tolerating":[59,179],"more":[60],"than":[61],"a":[62,93,99,207],"constant":[63],"fraction":[64],"faulty":[66,169,183,225],"nodes.":[67],"The":[68,124],"work":[70],"anonymous":[72],"networks,":[73],"where":[74,120],"nodes":[75,111,170,226],"do":[76],"not":[77],"know":[78],"each":[79],"other.":[80],"Specifically,":[81],"main":[83],"results":[84],"are:":[85],"(1)A":[86],"algorithm":[90,129,163,219],"which":[91,106],"elects":[92],"with":[95,102,142,146,173,193,229],"high":[96,143,174,194,230],"probability":[97,144,147,195],"complete":[100],"network":[101],"n":[103,209],"nodes,":[104,184],"at":[107,166,180,222,240],"least":[108],"\u2309":[109],"n\u2308":[110],"are":[112],"non-faulty":[113],"remaining":[116],"can":[117],"be":[118],"faulty,":[119],"\u2265":[121,148],"(log2":[122],"n)/n.":[123],"time":[125],"is":[130,138,238],"O":[131,188],"(log":[132,189],"n\u03b1)":[133],"rounds":[134,191],"O((n0.5":[139,198],"log2.5":[140],"n)/2.5)":[141],"(i.e.,":[145],"1-1/n).":[149],"A":[150,201,232],"bound":[153,204],"\u03a9(n0.5":[155],"/":[156],"\u03b11.5)":[157],"messages":[158,215],"any":[160,217],"that":[164,220],"tolerates":[165,221],"most":[167,181,223],"(1-\u03b1)-fraction":[168,224],"succeeds":[172,228],"probability.":[175,231],"(2)A":[176],"algorithm,":[178],"\u230a(1-\u03b1)n\u230b":[182],"solves":[185],"n/\u03b1)":[190],"uses":[196],"only":[197],"log1.5n)/\u03b11.5)":[199],"messages.":[200],"matching":[202],"(up":[205],"to":[206],"polylog":[208],"factor)":[210],"\u03a9":[212],"(n0.5":[213],"/\u03b11.5)":[214],"full":[233],"available":[239],"[17].":[241]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2021-08-02T00:00:00"}