{"paper":{"title":"Deterministic Leader Election Takes $\\Theta(D + \\log n)$ Bit Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Akka Zemmari, Arnaud Casteigts, John Michael Robson, Yves M\\'etivier","submitted_at":"2016-05-06T12:01:40Z","abstract_excerpt":"Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called \\STT, for electing deterministically a leader in an arbitrary network, assuming processors have unique identifiers of size $O(\\log n)$, where $n$ is the number of processors. It elects a leader in $O(D +\\log n)$ rounds, where $D$ is the diameter of the network, with messages of size $O(1)$. Thus it has a bit round complexity of $O(D +\\log n)$. This substantially improves upon the best known algorithm whose bit round complexity is $O(D\\log n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01903","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}