Cover Image

Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kaur, Tanvir, Gorain, Barun, Mondal, Kaushik
Format:	Preprint
Published:	2024
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 Dispersion of Silent Robots in a Ring
by: Das, Bibhuti, et al.
Published: (2024)

Balanced Dispersion on Time-Varying Dynamic Graphs
by: Saxena, Ashish, et al.
Published: (2024)

Black Hole Search in Dynamic Graphs
by: Kaur, Tanvir, et al.
Published: (2024)

Black Hole Search: Dynamics, Distribution, and Emergence
by: Kaur, Tanvir, et al.
Published: (2026)

Leader Election via Unique Sink Orientation
by: Chalopin, Jérémie, 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)

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

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

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

When Agents are Powerful: Black Hole Search with Verification in Time-Varying Graphs
by: Kaur, Tanvir, et al.
Published: (2025)

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

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

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

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

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

Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
by: Saxena, Ashish, et al.
Published: (2025)

Exploration on Highly Dynamic Graphs
by: Saxena, Ashish, et al.
Published: (2026)

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

Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks
by: Sadhukhan, Abhijit, et al.
Published: (2026)

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

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

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

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

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

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

Distributed Renaming with Subquadratic Bits via Scalable Committee Election
by: Bai, Sirui, et al.
Published: (2026)

Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
by: Gaur, Gaurav, et al.
Published: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

Efficient Local-to-Global Collaborative Perception via Joint Communication and Computation Optimization
by: Zhang, Hui, et al.
Published: (2026)

Demeter: Resource-Efficient Distributed Stream Processing under Dynamic Loads with Multi-Configuration Optimization
by: Geldenhuys, Morgan, et al.
Published: (2024)

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

Synchronization in Anonymous Networks Under Arbitrary Dynamics
by: Bazzi, Rida, et al.
Published: (2025)

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

Quantum Communication Advantage for Leader Election and Agreement
by: Dufoulon, Fabien, 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)

Configuration management in the distributed cloud
by: Ranković, Tamara, et al.
Published: (2024)

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

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

Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure
by: Fraigniaud, Pierre, et al.
Published: (2024)

Optimizing Streamlined Blockchain Consensus with Generalized Weighted Voting and Enhanced Leader Rotation
by: Micloiu, Diana, et al.
Published: (2024)