1 citations · 1 across the 4 of their papers we have counts for
4 papers
Computing Functions by Teams of Deterministic Finite Automata
Debasish Pattanayak, Andrzej Pelc
We consider the task of computing functions , where is the set of natural numbers, by finite teams of agents modelled as deterministic…
Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs
Debasish Pattanayak, Andrzej Pelc
Treasure hunt and rendezvous are fundamental tasks performed by mobile agents in graphs. In treasure hunt, an agent has to find an inert target (called treasure) situated at an unk…
Convergence of Even Simpler Robots without Location Information
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal +1
The design of distributed gathering and convergence algorithms for tiny robots has recently received much attention. In particular, it has been shown that convergence problems can…
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection
Debasish Pattanayak, Kaushik Mondal, H. Ramesh +1
There has been a wide interest in designing distributed algorithms for tiny robots. In particular, it has been shown that the robots can complete certain tasks even in the presence…