Pages that link to "Item:Q2318113"
From MaRDI portal
The following pages link to Asynchronous approach in the plane: a deterministic polynomial algorithm (Q2318113):
Displaying 8 items.
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- Deterministic polynomial approach in the plane (Q2353250) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- Deterministic Polynomial Approach in the Plane (Q5327463) (← links)
- Almost universal anonymous rendezvous in the plane (Q6046947) (← links)
- Deterministic rendezvous in infinite trees (Q6140349) (← links)
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs (Q6195335) (← links)
- Asynchronous approach in the plane: a deterministic polynomial algorithm (Q6487480) (← links)