Image de couverture de livre

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chalopin, Jérémie, Das, Shantanu, Kokkou, Maria
Format:	Preprint
Publié:	2024
Sujets:	Distributed, Parallel, and Cluster Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes
par: Chalopin, Jérémie, et autres
Publié: (2025)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction
par: Chalopin, Jérémie, et autres
Publié: (2024)

Leader Election via Unique Sink Orientation
par: Chalopin, Jérémie, et autres
Publié: (2025)

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
par: Chalopin, Jérémie, et autres
Publié: (2026)

Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness
par: Chalopin, Jérémie, et autres
Publié: (2026)

Content-Oblivious Leader Election in 2-Edge-Connected Networks
par: Chalopin, Jérémie, et autres
Publié: (2025)

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
par: Chalopin, Jérémie, et autres
Publié: (2025)

Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
par: Gąsieniec, Leszek, et autres
Publié: (2025)

Deterministic Self-Stabilizing BFS Construction in Constant Space
par: Blin, Lélia, et autres
Publié: (2025)

PALE: Partially Asynchronous Agile Leader Election
par: Sidik, Bronislav, et autres
Publié: (2018)

Minimalist Leader Election Under Weak Communication
par: Vacus, Robin, et autres
Publié: (2025)

A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols
par: Austin, Henry, et autres
Publié: (2025)

Efficient Counting and Simulation in Content-Oblivious Rings
par: Chalopin, Jérémie, et autres
Publié: (2026)

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

Optimizing Streamlined Blockchain Consensus with Generalized Weighted Voting and Enhanced Leader Rotation
par: Micloiu, Diana, et autres
Publié: (2024)

Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election
par: Chang, Yi-Jun, et autres
Publié: (2025)

Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
par: Kaur, Tanvir, et autres
Publié: (2024)

Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks
par: Sadhukhan, Abhijit, et autres
Publié: (2026)

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
par: Kanaya, Haruki, et autres
Publié: (2024)

Asymptotic Analysis of a Leader Election Algorithm
par: Lavault, Christian, et autres
Publié: (2006)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

Reputation-Based Leader Election under Partial Synchrony: Towards a Protocol-Independent Abstraction with Enhanced Guarantees
par: Liu, Xuyang, et autres
Publié: (2025)

Content-Oblivious Leader Election on Rings
par: Frei, Fabian, et autres
Publié: (2024)

Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
par: Hillebrandt, Henning, et autres
Publié: (2026)

Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
par: Padalkin, Andreas, et autres
Publié: (2024)

Fast Reconfiguration for Programmable Matter
par: Kostitsyna, Irina, et autres
Publié: (2022)

Herring: Parallel Batch-Order-Fairness on DAG-based Blockchain Consensus
par: Putnik, Marko, et autres
Publié: (2026)

Anonymous Self-Stabilising Localisation via Spatial Population Protocols
par: Gąsieniec, Leszek, et autres
Publié: (2024)

Distributed Renaming with Subquadratic Bits via Scalable Committee Election
par: Bai, Sirui, et autres
Publié: (2026)

Beeping Deterministic CONGEST Algorithms in Graphs
par: Garncarek, Pawel, et autres
Publié: (2025)

Dynatune: Dynamic Tuning of Raft Election Parameters Using Network Measurement
par: Shiozaki, Kohya, et autres
Publié: (2025)

Agent-based Leader Election, MST, and Beyond
par: Kshemkalyani, Ajay D., et autres
Publié: (2024)

Quantum Communication Advantage for Leader Election and Agreement
par: Dufoulon, Fabien, et autres
Publié: (2025)

Polylog-Competitive Deterministic Local Routing and Scheduling
par: Haeupler, Bernhard, et autres
Publié: (2024)

Towards Optimal Deterministic LOCAL Algorithms on Trees
par: Brandt, Sebastian, et autres
Publié: (2025)

Deterministic Parallel High-Quality Hypergraph Partitioning
par: Krause, Robert, et autres
Publié: (2025)

Self-Evolving Distributed Memory Architecture for Scalable AI Systems
par: Li, Zixuan, et autres
Publié: (2026)

The Blockchain Execution Dilemma: Optimizing Revenue XOR Fair Ordering
par: Pugatsov, Artjom, et autres
Publié: (2026)

NEMO: Faster Parallel Execution for Highly Contended Blockchain Workloads (Full version)
par: Ezard, François, et autres
Publié: (2025)

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
par: Bhagat, Subhash, et autres
Publié: (2024)