Linear rendezvous with asymmetric clocks
From MaRDI portal
Publication:5091103
DOI10.4230/LIPICS.OPODIS.2018.25OpenAlexW2913072956MaRDI QIDQ5091103FDOQ5091103
Authors: 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
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- On the Lambert \(w\) function
- Searching in the plane
- Asynchronous deterministic rendezvous in graphs
- Deterministic rendezvous in graphs
- Inequalities on the Lambert \(W\) function and hyperpower function
- Title not available (Why is that?)
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Online searching with turn cost
- On the linear search problem
- Yet more on the linear search problem
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- The gathering problem for two oblivious robots with unreliable compasses
- Asynchronous Deterministic Rendezvous on the Line
- Parallel searching in the plane
- Group search on the line
- Search on a line with faulty robots
- Rendezvous and election of mobile agents: Impact of sense of direction
- Tell Me Where I Am So I Can Meet You Sooner
- On deterministic rendezvous at a node of agents with arbitrary velocities
- Wait-free gathering without chirality
- Linear Search with Terrain-Dependent Speeds
- Fast rendezvous on a cycle by agents with different speeds
This page was built for publication: Linear rendezvous with asymmetric clocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091103)
