25 citations · 112 across the 30 of their papers we have counts for
Showing cs.MAShow all
2 papers · 1 filter
cs.MA2013★ 9 cited
Rendezvous of Two Robots with Constant Memory
Paola Flocchini, Nicola Santoro, Giovanni Viglietta +1
We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without…
cs.MA2012★ 3 cited
Rendezvous of two robots with visible bits
Giovanni Viglietta
We study the rendezvous problem for two robots moving in the plane (or on a line). Robots are autonomous, anonymous, oblivious, and carry colored lights that are visible to both. W…