Linear rendezvous with asymmetric clocks
From MaRDI portal
Publication:5091103
DOI10.4230/LIPIcs.OPODIS.2018.25OpenAlexW2913072956MaRDI QIDQ5091103
Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis
Publication date: 21 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.OPODIS.2018.25
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- Rendezvous and election of mobile agents: Impact of sense of direction
- On deterministic rendezvous at a node of agents with arbitrary velocities
- On the Lambert \(w\) function
- Parallel searching in the plane
- Fast rendezvous on a cycle by agents with different speeds
- Asynchronous deterministic rendezvous in graphs
- Online searching with turn cost
- Deterministic rendezvous in graphs
- On the linear search problem
- Yet more on the linear search problem
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- Wait-Free Gathering Without Chirality
- Tell Me Where I Am So I Can Meet You Sooner
- Asynchronous Deterministic Rendezvous on the Line
- Group Search on the Line
- How to meet asynchronously at polynomial cost
- Linear Search with Terrain-Dependent Speeds
- Search on a Line with Faulty Robots
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
This page was built for publication: Linear rendezvous with asymmetric clocks
