Cover Image

Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sadhukhan, Abhijit, Bhattacharya, Adri, Molla, Anisur Rahaman
Format:	Preprint
Published:	2026
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Fault-Tolerant Dispersion on Oriented Grids
by: Banerjee, Rik, et al.
Published: (2024)

Agent-based Leader Election, MST, and Beyond
by: Kshemkalyani, Ajay D., et al.
Published: (2024)

Optimizing Robot Dispersion on Grids: with and without Fault Tolerance
by: Banerjee, Rik, et al.
Published: (2024)

Semi-Synchronous Exploration in Dynamic Graphs
by: Saxena, Ashish, et al.
Published: (2026)

Distributed Butterfly Analysis using Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)

Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient
by: Chand, Prabhat Kumar, et al.
Published: (2024)

Computing Tree Structures in Anonymous Graphs via Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)

Content-Oblivious Leader Election in 2-Edge-Connected Networks
by: Chalopin, Jérémie, et al.
Published: (2025)

Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)

Dispersion is (Almost) Optimal under (A)synchrony
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

PALE: Partially Asynchronous Agile Leader Election
by: Sidik, Bronislav, et al.
Published: (2018)

Leader Election via Unique Sink Orientation
by: Chalopin, Jérémie, et al.
Published: (2025)

Minimalist Leader Election Under Weak Communication
by: Vacus, Robin, et al.
Published: (2025)

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
by: Kanaya, Haruki, et al.
Published: (2024)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction
by: Chalopin, Jérémie, et al.
Published: (2024)

Asymptotic Analysis of a Leader Election Algorithm
by: Lavault, Christian, et al.
Published: (2006)

Black Hole Search in Dynamic Tori
by: Bhattacharya, Adri, et al.
Published: (2024)

Reputation-Based Leader Election under Partial Synchrony: Towards a Protocol-Independent Abstraction with Enhanced Guarantees
by: Liu, Xuyang, et al.
Published: (2025)

Optimal Dispersion Under Asynchrony
by: Pattanayak, Debasish, et al.
Published: (2025)

Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes
by: Chalopin, Jérémie, et al.
Published: (2025)

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
by: Chalopin, Jérémie, et al.
Published: (2024)

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
by: Chalopin, Jérémie, et al.
Published: (2025)

Uniform Partitioning of a Bounded Region using Opaque ASYNC Luminous Mobile Robots
by: Pramanick, Subhajit, et al.
Published: (2023)

Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots
by: Jana, Saswata, et al.
Published: (2025)

Perpetual Exploration of a Ring in Presence of Byzantine Black Hole
by: Goswami, Pritam, et al.
Published: (2024)

Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents
by: Bar, Rajashree, et al.
Published: (2025)

Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election
by: Chang, Yi-Jun, et al.
Published: (2025)

A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols
by: Austin, Henry, et al.
Published: (2025)

Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
by: Kaur, Tanvir, et al.
Published: (2024)

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
by: Sudo, Yuichi
Published: (2025)

Agentic Distributed Computing
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Content-Oblivious Leader Election on Rings
by: Frei, Fabian, et al.
Published: (2024)

Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience
by: Komatovic, Jovan, et al.
Published: (2024)

Separation of Unconscious Robots with Obstructed Visibility
by: Pyati, Prajyot, et al.
Published: (2025)

Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
by: Gąsieniec, Leszek, et al.
Published: (2025)

Perpetual exploration in anonymous synchronous networks with a Byzantine black hole
by: Bhattacharya, Adri, et al.
Published: (2025)

Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
by: Albouy, Timothé, et al.
Published: (2023)

Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness
by: Chalopin, Jérémie, et al.
Published: (2026)

Dynatune: Dynamic Tuning of Raft Election Parameters Using Network Measurement
by: Shiozaki, Kohya, et al.
Published: (2025)

Distributed And Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs
by: Dou, Jinfeng, et al.
Published: (2024)