Optimally reordering mobile agents on parallel rows
From MaRDI portal
Publication:6185843
DOI10.1016/j.tcs.2023.114330MaRDI QIDQ6185843
Dmitry Rabinovich, Michael Amir, Alfred Marcel Bruckstein
Publication date: 8 January 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- The \((n^ 2-1)\)-puzzle and related relocation problems
- Asynchronous filling by myopic luminous robots
- A pedestrian's view on interacting particle systems, KPZ universality and random matrices
- Instance-Optimal Geometric Algorithms
- Puzzle-based storage systems
- How to meet asynchronously at polynomial cost
- Pattern Formation by Oblivious Asynchronous Mobile Robots
This page was built for publication: Optimally reordering mobile agents on parallel rows
