Cover Image

Deterministic Self-Stabilizing BFS Construction in Constant Space

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blin, Lélia, Petit, Franck, Tixeuil, Sébastien
Format:	Preprint
Published:	2025
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

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

On the Solvability of Byzantine-tolerant Reliable Communication in Dynamic Networks
by: Bonomi, Silvia, et al.
Published: (2025)

A New Probabilistic Mobile Byzantine Failure Model for Self-Protecting Systems
by: Bonomi, Silvia, et al.
Published: (2025)

Stand-Up Indulgent Gathering on Rings
by: Bramas, Quentin, et al.
Published: (2024)

Data Poisoning Attacks in Gossip Learning
by: Pham, Alexandre, et al.
Published: (2024)

Emergent Peer-to-Peer Multi-Hub Topology
by: Legheraba, Mohamed Amine, et al.
Published: (2024)

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

Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots
by: Bramas, Quentin, et al.
Published: (2023)

Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
by: Sudo, Yuichi, et al.
Published: (2026)

LIFT: Byzantine Resilient Hub-Sampling
by: Legheraba, Mohamed Amine, et al.
Published: (2026)

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

Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)

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

BLEST: Blazingly Efficient BFS using Tensor Cores
by: Elbek, Deniz, et al.
Published: (2025)

Revisited Convergence of Dolev et al BFS Spanning Tree Algorithm
by: Altisen, Karine, 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)

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

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026)

Beeping Deterministic CONGEST Algorithms in Graphs
by: Garncarek, Pawel, et al.
Published: (2025)

Self-Stabilizing MIS Computation in the Beeping Model
by: Giakkoupis, George, et al.
Published: (2024)

Towards Optimal Deterministic LOCAL Algorithms on Trees
by: Brandt, Sebastian, et al.
Published: (2025)

Deterministic Parallel High-Quality Hypergraph Partitioning
by: Krause, Robert, et al.
Published: (2025)

Polylog-Competitive Deterministic Local Routing and Scheduling
by: Haeupler, Bernhard, et al.
Published: (2024)

Fully Adaptive Self-Stabilizing Transformer for LCL Problems
by: Bitton, Shimon, et al.
Published: (2021)

Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model
by: Hadzilacos, Vassos, et al.
Published: (2026)

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
by: Bhagat, Subhash, et al.
Published: (2024)

Minimizing Intellectual Property Risks via Self-Stabilizing Algorithms
by: Kennedy, Ken, et al.
Published: (2026)

Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid
by: Gao, Younan, et al.
Published: (2024)

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

Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2024)

Gradient Clock Synchronization with Practically Constant Local Skew
by: Lenzen, Christoph
Published: (2025)

Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
by: Gańczorz, Adam, et al.
Published: (2024)

The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms
by: Kakugawa, Hirotsugu, et al.
Published: (2025)

Towards Learning-Augmented Peer-to-Peer Networks: Self-Stabilizing Graph Linearization with Untrusted Advice
by: Aradhya, Vijeth, et al.
Published: (2025)

TailBench++: Flexible Multi-Client, Multi-Server Benchmarking for Latency-Critical Workloads
by: Li, Zhilin, et al.
Published: (2025)

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures
by: Schneider, Philipp
Published: (2025)

Minimizing CGYRO HPC Communication Costs in Ensembles with XGYRO by Sharing the Collisional Constant Tensor Structure
by: Sfiligoi, Igor, et al.
Published: (2025)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
by: Bonomi, Silvia, et al.
Published: (2021)

Early-Stabilizing Counting
by: Lenzen, Christoph, et al.
Published: (2026)

DGRO: Diameter-Guided Ring Optimization for Integrated Research Infrastructure Membership
by: Wu, Shixun, et al.
Published: (2024)