Content-oblivious leader election is possible in all 2-edge-connected networks (with a known size bound) and on unoriented rings (with no bound), resolving two open conjectures.
Secure distributed computing made (nearly) optimal
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Content-Oblivious Leader Election in 2-Edge-Connected Networks
Content-oblivious leader election is possible in all 2-edge-connected networks (with a known size bound) and on unoriented rings (with no bound), resolving two open conjectures.