Pages that link to "Item:Q5176205"
From MaRDI portal
The following pages link to On the computational power of oblivious robots (Q5176205):
Displaying 15 items.
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Position discovery for a system of bouncing robots (Q498402) (← links)
- Localization for a system of colliding robots (Q498669) (← links)
- Universal coating for programmable matter (Q529029) (← links)
- Synchronous robots vs asynchronous lights-enhanced robots on graphs (Q737100) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Communication and location discovery in geometric ring networks (Q1740645) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- Survivability of bouncing robots (Q2821106) (← links)
- Leader Election and Shape Formation with Self-organizing Programmable Matter (Q2948412) (← links)
- Information Spreading by Mobile Particles on a Line (Q3460722) (← links)
- (Q5075773) (← links)
- Pattern Formation by Oblivious Asynchronous Mobile Robots (Q5258906) (← links)
- Gathering in the plane of location-aware robots in the presence of spies (Q5918903) (← links)