The rendezvous-search problem was posed by the author 25 years ago. In its basic form, it
asks how two unit speed players can find each other in least expected time, when randomly …

Cognitive radio networks enable unlicensed users to communicate using the licensed
spectrum without causing interference to legitimate users. To establish a communication …

Two mobile agents having distinct identifiers and located in nodes of an unknown
anonymous connected graph, have to meet at some node of the graph. We seek fast …

Two mobile agents (robots) having distinct labels and located in nodes of an unknown
anonymous connected graph have to meet. We consider the asynchronous version of this …

Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite,
unknown connected graph or in an unknown connected terrain in the plane. Agents are …

In the rendezvous search problem, two mobile agents must move along the n nodes of a
network so as to minimize the time required to meet or rendezvous. When the mobile agents …

Two identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown
graph and move synchronously from node to node with the goal of meeting. This …

A team consisting of an unknown number of mobile agents, starting from different nodes of
an unknown network, have to meet at the same node. Agents move in synchronous rounds …

Two mobile agents starting at different nodes of an unknown network have to meet. This task
is known in the literature as rendezvous. Each agent has a different label which is a positive …

Two anonymous mobile agents (robots) moving in an asynchronous manner have to meet in
an infinite grid of dimension δ> 0, starting from two arbitrary positions at distance at most d …