{"id":"https://openalex.org/W2080556744","doi":"https://doi.org/10.1137/s0097539700376007","title":"Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model","display_name":"Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2080556744","doi":"https://doi.org/10.1137/s0097539700376007","mag":"2080556744"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539700376007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700376007","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/A5088846595","display_name":"Alexander Russell","orcid":"https://orcid.org/0000-0002-8228-6238"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander Russell","raw_affiliation_strings":["University of Connecticut"],"affiliations":[{"raw_affiliation_string":"University of Connecticut","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030610930","display_name":"Michael Saks","orcid":"https://orcid.org/0000-0003-1659-7190"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Saks","raw_affiliation_strings":["Rutgers, The State University of New Jersey [New Brunswick]"],"affiliations":[{"raw_affiliation_string":"Rutgers, The State University of New Jersey [New Brunswick]","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052332525","display_name":"David Zuckerman","orcid":"https://orcid.org/0000-0002-4749-3223"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Zuckerman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088846595"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.105,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.88267869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"6","first_page":"1645","last_page":"1662"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9995999932289124,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9988999962806702,"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.9959999918937683,"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/binary-logarithm","display_name":"Binary logarithm","score":0.6880481243133545},{"id":"https://openalex.org/keywords/coin-flipping","display_name":"Coin flipping","score":0.6568665504455566},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6522535085678101},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.613171398639679},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6003714203834534},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5768348574638367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5759304165840149},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5483442544937134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5187690258026123},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4983632564544678},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.48094624280929565},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.46138694882392883},{"id":"https://openalex.org/keywords/communication-source","display_name":"Communication source","score":0.4456348419189453},{"id":"https://openalex.org/keywords/iterated-logarithm","display_name":"Iterated logarithm","score":0.41296058893203735},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39674293994903564},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30556052923202515},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10405164957046509},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09460610151290894}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6880481243133545},{"id":"https://openalex.org/C97399411","wikidata":"https://www.wikidata.org/wiki/Q825367","display_name":"Coin flipping","level":2,"score":0.6568665504455566},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6522535085678101},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.613171398639679},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6003714203834534},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5768348574638367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5759304165840149},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5483442544937134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5187690258026123},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4983632564544678},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.48094624280929565},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.46138694882392883},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.4456348419189453},{"id":"https://openalex.org/C130594498","wikidata":"https://www.wikidata.org/wiki/Q2028293","display_name":"Iterated logarithm","level":3,"score":0.41296058893203735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39674293994903564},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30556052923202515},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10405164957046509},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09460610151290894},{"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/s0097539700376007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700376007","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":[{"id":"https://metadata.un.org/sdg/16","score":0.8199999928474426,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1529556207","https://openalex.org/W1980985945","https://openalex.org/W1994659270","https://openalex.org/W1999678910","https://openalex.org/W2042587503","https://openalex.org/W2047541256","https://openalex.org/W2115000186","https://openalex.org/W4231916799","https://openalex.org/W4238472918"],"related_works":["https://openalex.org/W1544151914","https://openalex.org/W2188175199","https://openalex.org/W1878416245","https://openalex.org/W4287391350","https://openalex.org/W3120725310","https://openalex.org/W2092764775","https://openalex.org/W1608733163","https://openalex.org/W4312268648","https://openalex.org/W1985641825","https://openalex.org/W2021550994"],"abstract_inverted_index":{"Collective":[0],"coin-flipping":[1,59],"is":[2,26,62,127],"the":[3,20,88,94,117,132,144,156],"problem":[4],"of":[5,67,124,134,137,158,160,162],"producing":[6],"common":[7],"random":[8,52,135],"bits":[9,86],"in":[10,36,87,143],"a":[11,128,152],"distributed":[12],"computing":[13],"environment":[14],"with":[15],"adversarial":[16],"faults.":[17],"We":[18,44,54],"consider":[19],"perfect":[21],"information":[22],"model:":[23],"all":[24],"communication":[25,78,85],"by":[27],"broadcast":[28],"and":[29],"corrupt":[30,65],"players":[31,48],"are":[32],"computationally":[33],"unbounded.":[34],"Protocols":[35],"this":[37,125],"model":[38],"may":[39],"involve":[40],"many":[41],"asynchronous":[42],"rounds.":[43,111],"assume":[45],"that":[46,56,61],"honest":[47],"communicate":[49],"only":[50],"uniformly":[51],"bits.":[53],"demonstrate":[55],"any":[57],"n-player":[58],"protocol":[60],"resilient":[63],"against":[64],"coalitions":[66],"linear":[68],"size":[69,163],"must":[70],"use":[71],"either":[72],"at":[73,81],"least":[74,82],"[1/2":[75,108],"-":[76,109],"o(1)]log*n":[77,110],"rounds":[79],"or":[80],"[log(2k-1)n":[83],"]1-o(1)":[84],"kth":[89],"round,":[90],"where":[91],"log(j)":[92],"denotes":[93],"logarithm":[95],"iterated":[96],"j":[97],"times.":[98],"In":[99],"particular,":[100],"protocols":[101],"using":[102,147],"one":[103],"bit":[104],"per":[105],"round":[106],"require":[107],"These":[112],"bounds":[113],"also":[114],"apply":[115],"to":[116],"leader":[118],"election":[119],"problem.":[120],"The":[121],"primary":[122],"component":[123],"result":[126],"new":[129,153],"bound":[130,154],"on":[131,139,155],"influence":[133,157],"sets":[136,159],"variables":[138,161],"Boolean":[140],"functions.":[141],"Finally,":[142],"one-round":[145],"case,":[146],"other":[148],"methods":[149],"we":[150],"prove":[151],"$\\beta":[164,167],"n$":[165],"for":[166],">":[168],"1/3$.":[169]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}