Local MST computation with short advice (Q613116): Difference between revisions

@@ Property / cites work @@
+Distributed Computing – IWDC 2005
@@ Property / cites work: Distributed Computing – IWDC 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Oracle size
@@ Property / cites work: Oracle size / rank @@
+Normal rank
@@ Property / cites work @@
+Tree Exploration with an Oracle
@@ Property / cites work: Tree Exploration with an Oracle / rank @@
+Normal rank
@@ Property / cites work @@
+A Distributed Algorithm for Minimum-Weight Spanning Trees
+Normal rank
@@ Property / cites work @@
+Distributed verification of minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Proof labeling schemes
@@ Property / cites work: Proof labeling schemes / rank @@
+Normal rank
@@ Property / cites work @@
+What cannot be computed locally!
@@ Property / cites work: What cannot be computed locally! / rank @@
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed MST for constant diameter graphs
@@ Property / cites work: Distributed MST for constant diameter graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds
+Normal rank
@@ Property / cites work @@
+What can be computed locally?
@@ Property / cites work: What can be computed locally? / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank