{"id":"https://openalex.org/W2147823853","doi":"https://doi.org/10.1137/s0097539792240881","title":"Randomized Consensus in Expected $O(N\\log ^2 N)$ Operations Per Processor","display_name":"Randomized Consensus in Expected $O(N\\log ^2 N)$ Operations Per Processor","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W2147823853","doi":"https://doi.org/10.1137/s0097539792240881","mag":"2147823853"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792240881","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792240881","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036421091","display_name":"James Aspnes","orcid":"https://orcid.org/0000-0001-6188-1663"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"James Aspnes","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058429350","display_name":"Orli Waarts","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Orli Waarts","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036421091"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2528,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.94177336,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"25","issue":"5","first_page":"1024","last_page":"1044"},"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.9998000264167786,"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.9998000264167786,"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.9955999851226807,"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.972000002861023,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.748927116394043},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5923700332641602},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.578402578830719},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5284866094589233},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.4522363543510437},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4363344609737396},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.42311975359916687},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.41640031337738037},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3475152850151062},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3437691032886505},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30210527777671814},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28090715408325195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2324678599834442},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13054442405700684}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.748927116394043},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5923700332641602},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.578402578830719},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5284866094589233},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.4522363543510437},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4363344609737396},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.42311975359916687},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.41640031337738037},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3475152850151062},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3437691032886505},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30210527777671814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28090715408325195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2324678599834442},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13054442405700684},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539792240881","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792240881","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8700000047683716,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1482754306","https://openalex.org/W1519375772","https://openalex.org/W1591056583","https://openalex.org/W1964729314","https://openalex.org/W1973240854","https://openalex.org/W1988881980","https://openalex.org/W1999787317","https://openalex.org/W2021718102","https://openalex.org/W2035362408","https://openalex.org/W2042587503","https://openalex.org/W2048499028","https://openalex.org/W2085407655","https://openalex.org/W2322480514","https://openalex.org/W2796291475"],"related_works":["https://openalex.org/W3127082728","https://openalex.org/W3097369619","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W1974895073","https://openalex.org/W3210762197","https://openalex.org/W4287028817","https://openalex.org/W3192478689","https://openalex.org/W1541068124","https://openalex.org/W4232251396"],"abstract_inverted_index":{"This":[0,166],"paper":[1],"presents":[2],"a":[3,27,81,101,124],"new":[4],"randomized":[5],"algorithm":[6,25],"for":[7,183],"achieving":[8],"consensus":[9,76],"among":[10],"asynchronous":[11],"processors":[12,148,159],"that":[13,199],"communicate":[14],"by":[15,123,144,156],"reading":[16],"and":[17,37,58,119,140],"writing":[18],"shared":[19],"registers.":[20],"The":[21],"fastest":[22],"previously":[23,73],"known":[24,74],"requires":[26],"processor":[28,48,92,126],"to":[29,64,100,160,178,194],"perform":[30],"an":[31,52],"expected":[32,53,112],"$O(n^2":[33],"\\log":[34],"n)$":[35,56],"read":[36,57,118,139],"write":[38,59,120,141],"operations":[39,121,142],"in":[40,89,105,152],"the":[41,65,110,115,132,135,147,158,168,188,191],"worst":[42],"case.":[43],"In":[44],"our":[45,200],"algorithm,":[46],"each":[47,91,184],"executes":[49],"at":[50],"most":[51],"$O(n\\log":[54],"^2":[55],"operations,":[60],"which":[61,90],"is":[62,127,203],"close":[63],"trivial":[66],"lower":[67],"bound":[68,113,133],"of":[69,107,117,138,146,163,190],"$\\Omega":[70],"(n)$.":[71],"All":[72],"polynomial-time":[75],"algorithms":[77],"were":[78],"structured":[79],"around":[80],"shared-coin":[82,201],"protocol":[83,202],"[J.":[84],"Algorithms,":[85],"11(1990),":[86],"pp.":[87],"441\u2013446]":[88],"repeatedly":[93],"adds":[94],"random":[95],"$":[96],"\\pm":[97],"1$":[98],"votes":[99,162],"common":[102],"pool.":[103],"Consequently,":[104],"all":[106,145],"these":[108],"protocols,":[109],"worst-case":[111],"on":[114,134],"number":[116,137],"done":[122,143],"single":[125],"asymptotically":[128],"no":[129],"better":[130],"than":[131],"total":[136],"together.":[149],"We":[150,197],"succeed":[151],"breaking":[153],"this":[154],"tradition":[155],"allowing":[157],"cast":[161],"increasing":[164],"weights.":[165],"grants":[167],"adversary":[169],"greater":[170],"control":[171],"since":[172],"he":[173],"can":[174],"choose":[175],"from":[176],"up":[177],"n":[179],"different":[180],"weights":[181],"(one":[182],"processor)":[185],"when":[186],"determining":[187],"weight":[189],"next":[192],"vote":[193],"be":[195],"cast.":[196],"prove":[198],"nevertheless":[204],"correct":[205],"using":[206],"martingale":[207],"arguments.":[208]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}