A general lower bound for collaborative tree exploration (Q5919423): Difference between revisions

@@ Property / OpenAlex ID @@
+W2789516566
@@ Property / OpenAlex ID: W2789516566 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01753
@@ Property / arXiv ID: 1610.01753 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring Unknown Environments
@@ Property / cites work: Exploring Unknown Environments / rank @@
+Normal rank
@@ Property / cites work @@
+Many Random Walks Are Faster Than One
@@ Property / cites work: Many Random Walks Are Faster Than One / rank @@
+Normal rank
@@ Property / cites work @@
+Tree exploration with logarithmic memory
@@ Property / cites work: Tree exploration with logarithmic memory / rank @@
+Normal rank
@@ Property / cites work @@
+Piecemeal graph exploration by a mobile robot.
@@ Property / cites work: Piecemeal graph exploration by a mobile robot. / rank @@
+Normal rank
@@ Property / cites work @@
+The power of a pebble: Exploring and mapping directed graphs
+Normal rank
@@ Property / cites work @@
+Mapping simple polygons: how robots benefit from looking back
+Normal rank
@@ Property / cites work @@
+Mapping Simple Polygons
@@ Property / cites work: Mapping Simple Polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring an unknown graph
@@ Property / cites work: Exploring an unknown graph / rank @@
+Normal rank
@@ Property / cites work @@
+Fast collaborative graph exploration
@@ Property / cites work: Fast collaborative graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Tree exploration with little memory
@@ Property / cites work: Tree exploration with little memory / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected Graph Exploration with ⊝(log log <i>n</i>) Pebbles
+Normal rank
@@ Property / cites work @@
+Optimal constrained graph exploration
@@ Property / cites work: Optimal constrained graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Why Robots Need Maps
@@ Property / cites work: Why Robots Need Maps / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for the cover time of multiple random walks
+Normal rank
@@ Property / cites work @@
+Collective tree exploration
@@ Property / cites work: Collective tree exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Graph exploration by a finite automaton
@@ Property / cites work: Graph exploration by a finite automaton / rank @@
+Normal rank
@@ Property / cites work @@
+Online graph exploration algorithms for cycles and trees by multiple searchers
+Normal rank
@@ Property / cites work @@
+Q3911393
@@ Property / cites work: Q3911393 / rank @@
+Normal rank
@@ Property / cites work @@
+A Recursive Approach to Multi-robot Exploration of Trees
+Normal rank
@@ Property / cites work @@
+Strategies for parallel unaware cleaners
@@ Property / cites work: Strategies for parallel unaware cleaners / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank