Tight bounds for deterministic high-dimensional grid exploration
From MaRDI portal
Publication:6535010
DOI10.4230/LIPICS.DISC.2020.13zbMATH Open1543.68029MaRDI QIDQ6535010FDOQ6535010
Sebastian F. Brandt, Author name not available (Why is that?), Jara Uitto
Publication date: 2 November 2023
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
- Searching in the plane
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Exploring an unknown graph
- Graph exploration by a finite automaton
- Title not available (Why is that?)
- Collaborative search on the plane without communication
- Tree exploration with little memory
- Exploring Unknown Environments
- Solving the ANTS Problem with Asynchronous Finite State Machines
- Automata and Labyrinths
- The Revenge of the Linear Search Problem
- Title not available (Why is that?)
- How many ants does it take to find the food?
- Title not available (Why is that?)
- Exploring an Infinite Space with Finite Memory Scouts
- A tight lower bound for semi-synchronous collaborative grid exploration
- Title not available (Why is that?)
- Undirected Graph Exploration with ⊝(log log n) Pebbles
- Exploration of High-Dimensional Grids by Finite Automata
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)
