scientific article; zbMATH DE number 7525472
From MaRDI portal
Publication:5075773
DOI10.4230/LIPIcs.ESA.2019.35MaRDI QIDQ5075773
Jurek Czyzowicz, Andrzej Pelc, Dariusz Dereniowski
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- How many ants does it take to find the food?
- Automaten in planaren Graphen
- Piecemeal graph exploration by a mobile robot.
- The power of a pebble: Exploring and mapping directed graphs
- A tight lower bound for semi-synchronous collaborative grid exploration
- Graph exploration by a finite automaton
- Optimal constrained graph exploration
- Leader Election Problem versus Pattern Formation Problem
- Automata and Labyrinths
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Exploring an Infinite Space with Finite Memory Scouts
- Exploring an unknown graph
- Tree exploration with little memory
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- On the computational power of oblivious robots
- STACS 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
