{"id":"https://openalex.org/W1974895073","doi":"https://doi.org/10.1137/0220023","title":"Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks","display_name":"Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks","publication_year":1991,"publication_date":"1991-04-01","ids":{"openalex":"https://openalex.org/W1974895073","doi":"https://doi.org/10.1137/0220023","mag":"1974895073"},"language":"en","primary_location":{"id":"doi:10.1137/0220023","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220023","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/A5081092410","display_name":"Yehuda Afek","orcid":"https://orcid.org/0000-0001-8351-0927"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yehuda Afek","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","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":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081092410"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9559,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.7738394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"20","issue":"2","first_page":"376","last_page":"394"},"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.9994999766349792,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"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.9243741035461426},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7074466943740845},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6937562823295593},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6460817456245422},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.5910671353340149},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5562686920166016},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5100684762001038},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.5082518458366394},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5044611692428589},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4406812787055969},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3652101457118988},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36239123344421387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2638501226902008},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.21927186846733093},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1736685037612915}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.9243741035461426},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7074466943740845},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6937562823295593},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6460817456245422},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.5910671353340149},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5562686920166016},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5100684762001038},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.5082518458366394},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5044611692428589},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4406812787055969},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3652101457118988},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36239123344421387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2638501226902008},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.21927186846733093},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1736685037612915},{"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/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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0220023","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220023","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:CiteSeerX.psu:10.1.1.49.9770","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.9770","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.math.tau.ac.il/pub/afek/cmplt.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2077371116","https://openalex.org/W2079002298","https://openalex.org/W2093606353","https://openalex.org/W2176413683"],"related_works":["https://openalex.org/W1992134952","https://openalex.org/W2789179878","https://openalex.org/W2601062540","https://openalex.org/W3097369619","https://openalex.org/W1973013791","https://openalex.org/W3209455166","https://openalex.org/W4302907686","https://openalex.org/W2952144494","https://openalex.org/W4287691960","https://openalex.org/W2965861976"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,30,39,45,56,79],"problem":[4],"of":[5,29,38,51,81],"distributively":[6],"electing":[7],"a":[8,48],"leader":[9],"in":[10],"both":[11],"synchronous":[12,20,31,46,68],"and":[13,21,96],"asynchronous":[14,22,40],"complete":[15],"networks.":[16],"$O(n\\log":[17],"n)$":[18,54,73],"messages":[19],"algorithms":[23,95],"are":[24,86],"presented.":[25],"The":[26,89],"time":[27],"complexity":[28,58],"algorithm":[32,41,69],"is":[33,42,59,62],"$O(\\log":[34],"n)$,":[35],"while":[36],"that":[37,65],"$O(n)$.":[43],"In":[44,75],"case,":[47],"lower":[49],"bound":[50],"$\\Omega":[52,71],"(n\\log":[53],"on":[55],"message":[57],"proven.":[60],"It":[61],"also":[63],"proven":[64],"any":[66],"message-optimal":[67],"requires":[70],"(\\log":[72],"time.":[74],"proving":[76],"these":[77],"bounds,":[78],"type":[80],"operations":[82],"performed":[83],"by":[84],"nodes":[85],"not":[87,97],"restricted.":[88],"bounds":[90],"thus":[91],"apply":[92],"to":[93,99],"general":[94],"just":[98],"comparison-based":[100],"algorithms.":[101]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}