Copertina

Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chalopin, Jérémie, Das, Shantanu, Kokkou, Maria
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Distributed, Parallel, and Cluster Computing
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
di: Chalopin, Jérémie, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

Efficient Counting and Simulation in Content-Oblivious Rings
di: Chalopin, Jérémie, et al.
Pubblicazione: (2026)

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

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

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

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

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

Optimal Dispersion of Silent Robots in a Ring
di: Das, Bibhuti, et al.
Pubblicazione: (2024)

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

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

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

Silent Self-Stabilizing Ranking: Time Optimal and Space Efficient
di: Berenbrink, Petra, et al.
Pubblicazione: (2025)

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

Time- and Space-Optimal Silent Self-Stabilizing Exact Majority in Population Protocols
di: Kanaya, Haruki, et al.
Pubblicazione: (2025)

Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
di: Hillebrandt, Henning, et al.
Pubblicazione: (2026)

Silent Failures in Stateless Systems: Rethinking Anomaly Detection for Serverless Computing
di: Nguyen, Chanh, et al.
Pubblicazione: (2025)

Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter
di: Padalkin, Andreas, et al.
Pubblicazione: (2024)

Fast Reconfiguration for Programmable Matter
di: Kostitsyna, Irina, et al.
Pubblicazione: (2022)

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

Herring: Parallel Batch-Order-Fairness on DAG-based Blockchain Consensus
di: Putnik, Marko, et al.
Pubblicazione: (2026)

Anonymous Self-Stabilising Localisation via Spatial Population Protocols
di: Gąsieniec, Leszek, et al.
Pubblicazione: (2024)

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

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

Quantum Communication Advantage for Leader Election and Agreement
di: Dufoulon, Fabien, et al.
Pubblicazione: (2025)

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

AeroDaaS: A Programmable Drones-as-a-Service Platform for Intelligent Aerial Systems
di: Astu, Kautuk, et al.
Pubblicazione: (2026)

NEMO: Faster Parallel Execution for Highly Contended Blockchain Workloads (Full version)
di: Ezard, François, et al.
Pubblicazione: (2025)

The Blockchain Execution Dilemma: Optimizing Revenue XOR Fair Ordering
di: Pugatsov, Artjom, et al.
Pubblicazione: (2026)

Reliable Communication in Hybrid Authentication and Trust Models
di: Chotkan, Rowdy, et al.
Pubblicazione: (2024)

RASC: Enhancing Observability & Programmability in Smart Spaces
di: Karanika, Anna, et al.
Pubblicazione: (2026)