Nicola Santoro

Carleton University, University of Pisa

Papers

75

Total Citations

3,355

H-Index

29

About

Nicola Santoro is a distinguished computer scientist whose research has profoundly shaped the theoretical foundations of distributed computing, with a particular focus on autonomous mobile robots and coordination algorithms. Over more than two decades, Santoro has been a pioneering force in formalizing how teams of simple, anonymous, and oblivious robots can collectively solve complex geometric tasks — such as gathering at a common point or forming arbitrary patterns — without direct communication or persistent memory. His seminal 1999 work on pattern formation established early theoretical boundaries for what weak robotic agents can achieve through common knowledge alone, while his 2003 and 2005 papers on the Gathering Problem (with nearly 400 citations) cemented his reputation as a leader in this field. His landmark book-length treatment, *Distributed Computing by Oblivious Mobile Robots* (2012), has become an essential reference, accumulating nearly 300 citations. His later work extended these models to robots equipped with visible lights, broadening the computational landscape considerably. Collectively, Santoro's contributions have attracted well over 1,900 citations, influencing researchers across theoretical computer science, robotics, and multi-agent systems worldwide.

Research Focus

Key Achievements

29
H-Index
75
Papers
3,355
Total Citations
45
Avg Citations/Paper
🏆 Most Cited Paper
Gathering of asynchronous robots with limited visibility
396 citations · 2005
📈 Most Prolific Year: 2014 (6 Papers)
🤝 Key Collaborators: 41
🏛 Institutions: Carleton University, University of Pisa

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 36 days ago