Tight bounds for deterministic high-dimensional grid exploration
From MaRDI portal
Publication:6535010
Recommendations
- Exploration of High-Dimensional Grids by Finite Automata
- An improved strategy for exploring a grid polygon
- Tight bounds on probabilistic zero forcing on hypercubes and grids
- Competitive exploration of rectilinear polygons
- On a search problem in multidimensional grids
- Optimal constrained graph exploration
- Optimal constrained graph exploration
- RANDOM HYPERPLANE SEARCH TREES IN HIGH DIMENSIONS
Cites work
- scientific article; zbMATH DE number 3703973 (Why is no real title available?)
- scientific article; zbMATH DE number 3722098 (Why is no real title available?)
- scientific article; zbMATH DE number 1303571 (Why is no real title available?)
- scientific article; zbMATH DE number 1049494 (Why is no real title available?)
- A tight lower bound for semi-synchronous collaborative grid exploration
- Automata and Labyrinths
- Collaborative search on the plane without communication
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Exploration of High-Dimensional Grids by Finite Automata
- Exploring Unknown Environments
- Exploring an infinite space with finite memory scouts
- Exploring an unknown graph
- Graph exploration by a finite automaton
- How many ants does it take to find the food?
- Searching in the plane
- Solving the ANTS problem with asynchronous finite state machines
- The Revenge of the Linear Search Problem
- Tree exploration with little memory
- Undirected Graph Exploration with ⊝(log log n) Pebbles
This page was built for publication: Tight bounds for deterministic high-dimensional grid exploration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535010)
