Optimally reordering mobile agents on parallel rows
From MaRDI portal
Cites work
- A pedestrian's view on interacting particle systems, KPZ universality and random matrices
- Asynchronous filling by myopic luminous robots
- Instance-optimal geometric algorithms
- Pattern formation by oblivious asynchronous mobile robots
- Puzzle-based storage systems
- The \((n^ 2-1)\)-puzzle and related relocation problems
This page was built for publication: Optimally reordering mobile agents on parallel rows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185843)