Adrian Kosowski
Gdańsk University of Technology, Laboratoire Bordelais de Recherche en Informatique, Institut Polytechnique de Bordeaux, Centre Inria de l'université de Bordeaux, Délégation Paris 7, Institut national de recherche en sciences et technologies du numérique, Centre National de la Recherche Scientifique, Laboratoire d'Informatique Algorithmique: Fondements et Applications, Université Paris Cité
Papers
19
Total Citations
506
H-Index
12
About
Adrian Kosowski is a leading researcher in distributed computing, algorithmic robotics, and graph exploration. His work focuses on the fundamental challenges of coordinating multiple autonomous agents—such as robots or mobile patrols—in unknown or hostile environments. Kosowski is best known for his pioneering studies on gathering and patrolling, where he has shown how asynchronous oblivious robots can exploit symmetries to converge on a ring (102 citations) and how mobile agents with distinct speeds can optimally patrol fragmented boundaries (91 citations). His contributions extend to constructing maps of anonymous graphs using universal sequences (68 citations) and derandomizing random walks for fair exploration (21 citations). Kosowski has also tackled fault-tolerant monitoring, investigating how corrupted patrolmen can still secure a graph (24 citations), and has advanced the detection of black holes—dangerous nodes that destroy agents—in directed graphs (20 citations). With over 400 total citations, his work has profoundly influenced the theory of multi-agent systems, offering elegant solutions to problems of coordination, security, and efficiency in distributed networks.
Research Focus
Key Achievements
Top Papers
- 1
- 2Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds91 citations · 2011
- 3
- 4
- 5Optimal patrolling of fragmented boundaries33 citations · 2013
- 6
- 7
- 8Synchronous black hole search in directed graphs21 citations · 2011
- 9Synchronization Helps Robots to Detect Black Holes in Directed Graphs20 citations · 2009
- 10