Analysis of a memory-efficient self-stabilizing BFS spanning tree construction (Q2697434): Difference between revisions

@@ Property / cites work @@
+Self-stabilizing systems in spite of distributed control
+Normal rank
@@ Property / cites work @@
+Introduction to Distributed Self-Stabilizing Algorithms
+Normal rank
@@ Property / cites work @@
+A self-stabilizing algorithm for constructing spanning trees
+Normal rank
@@ Property / cites work @@
+Self-stabilizing depth-first search
@@ Property / cites work: Self-stabilizing depth-first search / rank @@
+Normal rank
@@ Property / cites work @@
+A self-stabilizing algorithm for constructing breadth-first trees
+Normal rank
@@ Property / cites work @@
+Self-stabilization of dynamic systems assuming only read/write atomicity
+Normal rank
@@ Property / cites work @@
+Q4259994
@@ Property / cites work: Q4259994 / rank @@
+Normal rank
@@ Property / cites work @@
+The first fully polynomial stabilizing algorithm for BFS tree construction
+Normal rank
@@ Property / cites work @@
+Memory requirements for silent stabilization
@@ Property / cites work: Memory requirements for silent stabilization / rank @@
+Normal rank
@@ Property / cites work @@
+Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
+Normal rank
@@ Property / cites work @@
+The Conic toolkit for building distributed systems
+Normal rank