Full Table Search by Polynomial Functions. - Nicola Santoro (Inf. Process. Lett., 1976)

Random access in a list environment. - Elena Lodi; Fabrizio Luccio; Linda Pagli; Nicola Santoro (Inf. Syst., 1976)

Distributed Control of Updates in Multiple-Copy Databases: A Time Optimal Algorithm. - Raúl J. Ramírez; Nicola Santoro (Berkeley Workshop, 1979)

Extending the Four Russians' Bound to General Matrix Multiplication. - Nicola Santoro (Inf. Process. Lett., 1980)

Chain Multiplication of Matrices of Approximately or Exactly the Same Size. - Nicola Santoro (Commun. ACM, 1984)

On the message complexity of distributed problems. - Nicola Santoro (Int. J. Parallel Program., 1984)

Sense of direction, topological awareness and communication complexity. - Nicola Santoro (SIGACT News, 1984)

Distributed Algorithms for Finding Centers and Medians in Networks. - Ephraim Korach; Doron Rotem; Nicola Santoro (ACM Trans. Program. Lang. Syst., 1984)

Geometric Containment is not Reducible to Pareto Dominance. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (STACS, 1985)

Labelling and Implicit Routing in Networks. - Nicola Santoro; Ramez Khatib (Comput. J., 1985)

Interpolation-Binary Search. - Nicola Santoro; Jeffrey B. Sidney (Inf. Process. Lett., 1985)

The un-merging problem. - Nicola Santoro (SIGACT News, 1985)

Distributed Sorting. - Doron Rotem; Nicola Santoro; Jeffrey B. Sidney (IEEE Trans. Computers, 1985)

Breaking Symmetry in Synchronous Networks. - Greg N. Frederickson; Nicola Santoro (Aegean Workshop on Computing, 1986)

Min-Max Heaps and Generalized Priority Queues. - M. D. Atkinson; Jörg-Rüdiger Sack; Nicola Santoro; Thomas Strothotte (Commun. ACM, 1986)

An improved algorithm for Boolean matrix multiplication. - Nicola Santoro; Jorge Urrutia (Computing, 1986)

Uniquely colourable m-dichromatic oriented graphs. - Victor Neumann-Lara; Nicola Santoro; Jorge Urrutia (Discret. Math., 1986)

Shout echo selection in distributed files. - Doron Rotem; Nicola Santoro; Jeffrey B. Sidney (Networks, 1986)

On the integer complexity of Boolean matrix multiplication. - Mike D. Atkinson; Nicola Santoro; Jorge Urrutia (SIGACT News, 1986)

Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters. - Michael D. Atkinson; Nicola Santoro; Jorge Urrutia (IEEE Trans. Commun., 1986)

Guessing Games and Distributed Computations in Synchronous Networks. - Jan van Leeuwen; Nicola Santoro; Jorge Urrutia; Shmuel Zaks (ICALP, 1987)

Improving Semi-Join Evaluation in Distributed Query Processing. - Ekow J. Otoo; Nicola Santoro; Doron Rotem (ICDCS, 1987)

Optimal VLSI Dictionary Machines on Meshes. - Frank K. H. A. Dehne; Nicola Santoro (ICPP, 1987)

Computing on a Systolic Screen: Hulls, Contours and Applications. - Frank K. H. A. Dehne; Jörg-Rüdiger Sack; Nicola Santoro (PARLE (1), 1987)

On the Expected Complexity of Distributed Selection. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney (STACS, 1987)

On the Packet Complexity of Distributed Selection. - Alberto Negro; Nicola Santoro; Jorge Urrutia (WDAG, 1987)

Analysis of a Distributed Algorithm for Extrema Finding in a Ring. - Doron Rotem; Ephraim Korach; Nicola Santoro (J. Parallel Distributed Comput., 1987)

Optimal Parallel Merging and Sorting Without Memory Conflicts. - Selim G. Akl; Nicola Santoro (IEEE Trans. Computers, 1987)

Geometric Containment and Vector Dominance. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (Theor. Comput. Sci., 1987)

Geometric Containment, Common Roots of Polynomials and Partial Orders. - Nicola Santoro; Stuart J. Sidney; Jorge Urrutia (STACS, 1988)

(Time × Space)-Efficient Implementations of Hierarchical Conceptual Models. - Nicola Santoro (WG, 1988)

A Practical Algorithm for Boolean Matrix Multiplication. - M. D. Atkinson; Nicola Santoro (Inf. Process. Lett., 1988)

On the Expected Complexity of Distributed Selection. - Nicola Santoro; Michael Scheutzow; Jeffrey B. Sidney (J. Parallel Distributed Comput., 1988)

TIME vs BITS. - Mark H. Overmars; Nicola Santoro (STACS, 1989)

Time is Not a Healer. - Nicola Santoro; Peter Widmayer (STACS, 1989)

Efficient Elections in Chordal Ring Networks. - Hagit Attiya; Jan van Leeuwen; Nicola Santoro; Shmuel Zaks (Algorithmica, 1989)

Geometric Containment and Partial Orders. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (SIAM J. Discret. Math., 1989)

Reduction Techniques for Selection in Distributed Files. - Nicola Santoro; Ed Suen (IEEE Trans. Computers, 1989)

Fault-intolerance of reconfigurable systolic arrays. - Amiya Nayak; Nicola Santoro; Richard Tan (FTCS, 1990)

Distributed Function Evaluation in the Presence of Transmission Faults. - Nicola Santoro; Peter Widmayer (SIGAL International Symposium on Algorithms, 1990)

Sums of lexicographically ordered sets. - M. D. Atkinson; Alberto Negro; Nicola Santoro (Discret. Math., 1990)

Bounds on Performance of VLSI Processor Arrays. - Amiya Nayak; Nicola Santoro (IPPS, 1991)

Tight Bounds for the Rectangualr Art Gallery Problem. - Jurek Czyzowicz; Eduardo Rivera-Campo; Nicola Santoro; Jorge Urrutia; Joseph Zaks (WG, 1991)

Computational Geometry Algorithms for the Systolic Screen. - Frank K. H. A. Dehne; Anne-Lise Hassenklover; Jörg-Rüdiger Sack; Nicola Santoro (Algorithmica, 1991)

Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links. - Amiya Nayak; Linda Pagli; Nicola Santoro (ICCI, 1992)

Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract). - Evangelos Kranakis; Nicola Santoro (WDAG, 1992)

The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence. - Una-May O'Reilly; Nicola Santoro (WG, 1992)

A Distributed Selection Algorithm and its Expected Communication Complexity. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney (Theor. Comput. Sci., 1992)

Efficient construction of catastrophic patterns for VLSI reconfigurable arrays. - Amiya Nayak; Linda Pagli; Nicola Santoro (Integr., 1993)

Optimal Fault-Tolerant Leader Election in Chordal Rings. - Bernard Mans; Nicola Santoro (FTCS, 1994)

On the Impact of Sense of Direction in Arbitrary Networks. - Bernard Mans; Nicola Santoro (ICDCS, 1994)

Preface. - Paola Flocchini; Bernard Mans; Nicola Santoro (SIROCCO, 1994)

Sense of Direction: Formal Definitions and Properties. - Paola Flocchini; Bernard Mans; Nicola Santoro (SIROCCO, 1994)

Guarding rectangular art galleries. - Jurek Czyzowicz; Eduardo Rivera-Campo; Nicola Santoro; Jorge Urrutia; Joseph Zaks (Discret. Appl. Math., 1994)

Trade-Offs in Non-Reversing Diameter. - Hans L. Bodlaender; Gerard Tel; Nicola Santoro (Nord. J. Comput., 1994)

Efficient reconfiguration technique for redundant ring networks. - Amiya Nayak; Nicola Santoro; Quanhu Xue (HICSS (2), 1995)

On the Complexity of Testing for Catastrophic Faults. - Nicola Santoro; Jiajun Ren; Amiya Nayak (ISAAC, 1995)

Translation Capabilities of Sense of Direction. - Paola Flocchini; Bernard Mans; Nicola Santoro (SIROCCO, 1995)

On Reliability Analysis of Chordal Rings. - Amiya Nayak; Nicola Santoro (J. Circuits Syst. Comput., 1995)

Ring reconfiguration in presence of close fault cuts. - Amiya Nayak; Nicola Santoro; Quanhu Xue (ISPAN, 1996)

Efficient Token-Based Control in Rings (Abstract). - Esteban Feuerstein; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Nicola Santoro (PODC, 1996)

On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy. - Amiya Nayak; Linda Pagli; Nicola Santoro (Integr., 1996)

Finding the Extrema of a Distributed Multiset. - Paola Alimonti; Paola Flocchini; Nicola Santoro (J. Parallel Distributed Comput., 1996)

Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. - Edson Cáceres; Frank K. H. A. Dehne; Afonso Ferreira; Paola Flocchini; Ingo Rieping; Alessandro Roncato; Nicola Santoro; Siang W. Song (ICALP, 1997)

Levels of Sense of Direction in Distributed Systems. - Paola Flocchini; Bernard Mans; Alessandro Roncato; Nicola Santoro (OPODIS, 1997)

Improved Bounds for Electing a Leader in a Synchronous Ring. - Mark H. Overmars; Nicola Santoro (Algorithmica, 1997)

On the Impact of Sense of Direction on Message Complexity. - Paola Flocchini; Bernard Mans; Nicola Santoro (Inf. Process. Lett., 1997)

Time-Message Trade-Offs for the Weak Unison Problem. - Amos Israeli; Evangelos Kranakis; Danny Krizanc; Nicola Santoro (Nord. J. Comput., 1997)

CA-Like Error Propagation in Fuzzy CA. - Paola Flocchini; Frédéric Geurts; Nicola Santoro (Parallel Comput., 1997)

Efficient Distributed Selection with Bounded Messages. - Alberto Negro; Nicola Santoro; Jorge Urrutia (IEEE Trans. Parallel Distributed Syst., 1997)

Irreversible Dynamos in Tori. - Paola Flocchini; Elena Lodi; Fabrizio Luccio; Nicola Santoro (Euro-Par, 1998)

Introduction: Distributed Data and Structures 1. - Nicola Santoro; Peter Widmayer (WDAS, 1998)

Symmetries and Sense of Direction in Labeled Graphs. - Paola Flocchini; Alessandro Roncato; Nicola Santoro (Discret. Appl. Math., 1998)

Topological Constraints for Sense of Direction. - Paola Flocchini; Nicola Santoro (Int. J. Found. Comput. Sci., 1998)

Efficient Token-Based Control in Rings. - Esteban Feuerstein; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Nicola Santoro (Inf. Process. Lett., 1998)

Sense of direction: Definitions, properties, and classes. - Paola Flocchini; Bernard Mans; Nicola Santoro (Networks, 1998)

Optimal Elections in Faulty Loop Networks and Applications. - Bernard Mans; Nicola Santoro (IEEE Trans. Computers, 1998)

Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Peter Widmayer (ISAAC, 1999)

Biconsistency and Homonymy in Distributed Systems with Edge Symmetry. - Paola Flocchini; Alessandro Roncato; Nicola Santoro (OPODIS, 1999)

Monotone Dynamos in Tori. - Paola Flocchini; Elena Lodi; Fabrizio Luccio; Linda Pagli; Nicola Santoro (SIROCCO, 1999)

Introduction: Distributed Data & Structures 2. - Yuri Breitbart; Sajal K. Das 001; Nicola Santoro; Peter Widmayer (WDAS, 1999)

Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone. - Nicola Santoro (WG, 1999)

Sorting Multisets in Anonymous Rings. - Paola Flocchini; Evangelos Kranakis; Nicola Santoro; Danny Krizanc; Flaminia L. Luccio (IPDPS, 2000)

Asynchronous to Synchronous transformations. - Una-May O'Reilly; Nicola Santoro (OPODIS, 2000)

An improved testing scheme for catastrophic fault patterns. - Amiya Nayak; Jiajun Ren; Nicola Santoro (Inf. Process. Lett., 2000)

A Mobile Agent Prototype for Distributed Search. - Elio Velazquez; Nicola Santoro; Amiya Nayak (MATA, 2001)

Pattern Formation by Anonymous Robots Without Chirality. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Peter Widmayer (SIROCCO, 2001)

On Finding Minimum Deadly Sets for Directed Networks. - Norbert Zeh; Nicola Santoro (SIROCCO, 2001)

Distributed Computations by Autonomous Mobile Robots. - Nicola Santoro (SOFSEM, 2001)

Gathering of Asynchronous Oblivious Robots with Limited Visibility. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Peter Widmayer (STACS, 2001)

Optimal irreversible dynamos in chordal rings. - Paola Flocchini; Frédéric Geurts; Nicola Santoro (Discret. Appl. Math., 2001)

Distributed computing on oriented anonymous hypercubes with faulty components. - Evangelos Kranakis; Nicola Santoro (Distributed Comput., 2001)

Black Hole Search by Mobile Agents in Hypercubes and Related Networks. - Stefan Dobrev; Paola Flocchini; Rastislav Kralovic; Giuseppe Prencipe; Peter Ruzicka; Nicola Santoro (OPODIS, 2002)

Searching for a black hole in arbitrary networks: optimal mobile agent protocols. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (PODC, 2002)

Capture of an intruder by mobile agents. - Lali Barrière; Paola Flocchini; Pierre Fraigniaud; Nicola Santoro (SPAA, 2002)

FUN with Algorithms - Foreword. - Elena Lodi; Linda Pagli; Nicola Santoro (Theor. Comput. Sci., 2002)

Solving the Robots Gathering Problem. - Mark Cieliebak; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (ICALP, 2003)

Mobile Agent Rendezvous in a Ring. - Evangelos Kranakis; Nicola Santoro; Cindy Sawchuk; Danny Krizanc (ICDCS, 2003)

Multiple Agents RendezVous in a Ring in Spite of a Black Hole. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (OPODIS, 2003)

Election and Rendezvous in Fully Anonymous Systems with Sense of Direction. - Lali Barrière; Paola Flocchini; Pierre Fraigniaud; Nicola Santoro (SIROCCO, 2003)

Can we elect if we cannot compare? - Lali Barrière; Paola Flocchini; Pierre Fraigniaud; Nicola Santoro (SPAA, 2003)

Searching Is Not Jumping. - Lali Barrière; Pierre Fraigniaud; Nicola Santoro; Dimitrios M. Thilikos (WG, 2003)

Tight Bounds for Synchronous Communication of Information Using Bits, Silence. - Una-May O'Reilly; Nicola Santoro (Discret. Appl. Math., 2003)

On time versus size for monotone dynamic monopolies in regular topologies. - Paola Flocchini; Rastislav Kralovic; Peter Ruzicka; Alessandro Roncato; Nicola Santoro (J. Discrete Algorithms, 2003)

Backward Consistency and Sense of Direction in Advanced Distributed Systems. - Paola Flocchini; Alessandro Roncato; Nicola Santoro (SIAM J. Comput., 2003)

Sense of direction in distributed computing. - Paola Flocchini; Bernard Mans; Nicola Santoro (Theor. Comput. Sci., 2003)

Computing on anonymous networks with sense of direction. - Paola Flocchini; Alessandro Roncato; Nicola Santoro (Theor. Comput. Sci., 2003)

Comparing Performance of Two Mobile Agent Platforms in Distributed Search. - Abdul-Rahman Mawlood-Yunis; Amiya Nayak; Doron Nussbaum; Nicola Santoro (IAT, 2004)

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. - Paola Flocchini; Antonio Mesa Enriques; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (IFIP TCS, 2004)

Multiple Mobile Agent Rendezvous in a Ring. - Paola Flocchini; Evangelos Kranakis; Danny Krizanc; Nicola Santoro; Cindy Sawchuk (LATIN, 2004)

On the Performance of Distributed Search by Mobile Agents. - Abdul-Rahman Mawlood-Yunis; Amiya Nayak; Doron Nussbaum; Nicola Santoro (MATA, 2004)

Computing All the Best Swap Edges Distributively. - Paola Flocchini; Linda Pagli; Giuseppe Prencipe; Nicola Santoro; Peter Widmayer; Tranos Zuva (OPODIS, 2004)

Improved Bounds for Optimal Black Hole Search with a Network Map. - Stefan Dobrev; Paola Flocchini; Nicola Santoro (SIROCCO, 2004)

Mobile Agents Rendezvous When Tokens Fail. - Paola Flocchini; Evangelos Kranakis; Danny Krizanc; Flaminia L. Luccio; Nicola Santoro; Cindy Sawchuk (SIROCCO, 2004)

Dynamic monopolies in tori. - Paola Flocchini; Elena Lodi; Fabrizio Luccio; Linda Pagli; Nicola Santoro (Discret. Appl. Math., 2004)

Fun with algorithms. - Elena Lodi; Linda Pagli; Nicola Santoro (Discret. Appl. Math., 2004)

Sorting and election in anonymous asynchronous rings. - Paola Flocchini; Evangelos Kranakis; Danny Krizanc; Flaminia L. Luccio; Nicola Santoro (J. Parallel Distributed Comput., 2004)

Mobile Agents Computing: Security Issues and Algorithmic Solutions. - Nicola Santoro (ICTCS, 2005)

Distributed Exploration of an Unknown Graph. - Shantanu Das 001; Paola Flocchini; Amiya Nayak; Nicola Santoro (SIROCCO, 2005)

Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. - Nicola Santoro; Peter Widmayer (SIROCCO, 2005)

Gathering of asynchronous robots with limited visibility. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Peter Widmayer (Theor. Comput. Sci., 2005)

Solving Distributed Mutual Exclusion using Cooperating Mobile Agents. - F. Ahmad; Nicola Santoro; Amiya Nayak; Nishith Goel; Alok R. Patnaik; Alka Srivastava (ACIS-ICIS, 2006)

Self-deployment Algorithms for Mobile Sensors on a Ring. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (ALGOSENSORS, 2006)

Black Hole Search in Asynchronous Rings Using Tokens. - Stefan Dobrev; Rastislav Kralovic; Nicola Santoro; Wei Shi 001 (CIAC, 2006)

Distributed Security Algorithms by Mobile Agents. - Paola Flocchini; Nicola Santoro (ICDCN, 2006)

Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search. - Stefan Dobrev; Paola Flocchini; Nicola Santoro (ICDCS, 2006)

Exploring an Unknown Graph to Locate a Black Hole Using Tokens. - Stefan Dobrev; Paola Flocchini; Rastislav Kralovic; Nicola Santoro (IFIP TCS, 2006)

Distributed Algorithms for Autonomous Mobile Robots. - Giuseppe Prencipe; Nicola Santoro (IFIP TCS, 2006)

Distributed Algorithms for Autonomous Mobile Robots. - Nicola Santoro (IFIP TCS, 2006)

Network decontamination with local immunization. - Fabrizio Luccio; Linda Pagli; Nicola Santoro (IPDPS, 2006)

Effective Elections for Anonymous Mobile Agents. - Shantanu Das 001; Paola Flocchini; Amiya Nayak; Nicola Santoro (ISAAC, 2006)

ZONER: A ZONE-based Sensor Relocation Protocol for Mobile Sensor Networks. - Xu Li 001; Nicola Santoro (LCN, 2006)

An Integrated Self-deployment and Coverage Maintenance Scheme for Mobile Sensor Networks. - Xu Li 001; Nicola Santoro (MSN, 2006)

Issues for Robust Consensus Building in P2P Networks. - Abdul-Rahman Mawlood-Yunis; Michael Weiss 001; Nicola Santoro (OTM Workshops (2), 2006)

Order and Balance in Continuously-Fault-Tolerant Distributions of Objects. - George Coucopoulos; Nishith Goel; Amiya Nayak; Nicola Santoro (Parallel and Distributed Computing and Networks, 2006)

On Fractional Dynamic Faults with Threshold. - Stefan Dobrev; Rastislav Kralovic; Richard Královic; Nicola Santoro (SIROCCO, 2006)

Groupings and Pairings in Anonymous Networks. - Jérémie Chalopin; Shantanu Das 001; Nicola Santoro (DISC, 2006)

Searching for a black hole in arbitrary networks: optimal mobile agents protocols. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Distributed Comput., 2006)

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively. - Paola Flocchini; Antonio Mesa Enriques; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (IEICE Trans. Inf. Syst., 2006)

Black hole search in common interconnection networks. - Stefan Dobrev; Paola Flocchini; Rastislav Kralovic; Peter Ruzicka; Giuseppe Prencipe; Nicola Santoro (Networks, 2006)

Design and analysis of distributed algorithms. - Nicola Santoro (Wiley, 2007)

Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents. - Stefan Dobrev; Nicola Santoro; Wei Shi 001 (Euro-Par, 2007)

Distributed Computation of All Node Replacements of a Minimum Spanning Tree. - Paola Flocchini; Toni Mesa Enriquez; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (Euro-Par, 2007)

Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs. - Nicola Santoro (FUN, 2007)

Scattered Black Hole Search in an Oriented Ring using Tokens. - Stefan Dobrev; Nicola Santoro; Wei Shi 001 (IPDPS, 2007)

Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. - Shantanu Das 001; Paola Flocchini; Nicola Santoro; Masafumi Yamashita (SIROCCO, 2007)

Mesh-Based Sensor Relocation for Coverage Maintenance in Mobile Sensor Networks. - Xu Li 001; Nicola Santoro; Ivan Stojmenovic (UIC, 2007)

Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. - Jérémie Chalopin; Shantanu Das 001; Nicola Santoro (DISC, 2007)

Mobile Search for a Black Hole in an Anonymous Ring. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Algorithmica, 2007)

Network decontamination in Presence of Local Immunity. - Fabrizio Luccio; Linda Pagli; Nicola Santoro (Int. J. Found. Comput. Sci., 2007)

On the longest increasing subsequence of a circular list. - Michael H. Albert; Mike D. Atkinson; Doron Nussbaum; Jörg-Rüdiger Sack; Nicola Santoro (Inf. Process. Lett., 2007)

Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. - Lali Barrière; Paola Flocchini; Pierre Fraigniaud; Nicola Santoro (Theory Comput. Syst., 2007)

Map construction of unknown graphs by multiple agents. - Shantanu Das 001; Paola Flocchini; Shay Kutten; Amiya Nayak; Nicola Santoro (Theor. Comput. Sci., 2007)

Agreement in synchronous networks with ubiquitous faults. - Nicola Santoro; Peter Widmayer (Theor. Comput. Sci., 2007)

Distributed Computing in the Presence of Mobile Faults. - Nicola Santoro; Peter Widmayer (Handbook of Parallel Computing, 2007)

Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments. - Eduardo Mesa Barrameda; Shantanu Das 001; Nicola Santoro (ALGOSENSORS, 2008)

Tree Decontamination with Temporary Immunity. - Paola Flocchini; Bernard Mans; Nicola Santoro (ISAAC, 2008)

Localized distance-sensitive service discovery in wireless sensor networks. - Xu Li 001; Nicola Santoro; Ivan Stojmenovic (FOWANC, 2008)

Mobile Entities Computing: Models and Problems. - Nicola Santoro (SIROCCO, 2008)

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. - Paola Flocchini; David Ilcinkas; Nicola Santoro (DISC, 2008)

Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens. - Stefan Dobrev; Nicola Santoro; Wei Shi 001 (Int. J. Found. Comput. Sci., 2008)

Computing all the best swap edges distributively. - Paola Flocchini; Linda Pagli; Giuseppe Prencipe; Nicola Santoro; Peter Widmayer (J. Parallel Distributed Comput., 2008)

Localized sensor self-deployment with coverage guarantee. - Xu Li 001; Hannes Frey; Nicola Santoro; Ivan Stojmenovic (ACM SIGMOBILE Mob. Comput. Commun. Rev., 2008)

On fractional dynamic faults with thresholds. - Stefan Dobrev; Rastislav Kralovic; Richard Královic; Nicola Santoro (Theor. Comput. Sci., 2008)

Self-deployment of mobile sensors on a ring. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Theor. Comput. Sci., 2008)

Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Peter Widmayer (Theor. Comput. Sci., 2008)

Localized Sensor Self-Deployment for Guaranteed Coverage Radius Maximization. - Xu Li 001; Hannes Frey; Nicola Santoro; Ivan Stojmenovic (ICC, 2009)

Map construction and exploration by mobile agents scattered in a dangerous network. - Paola Flocchini; Matthew Kellett; Peter C. Mason; Nicola Santoro (IPDPS, 2009)

Exploration of Periodically Varying Graphs. - Paola Flocchini; Bernard Mans; Nicola Santoro (ISAAC, 2009)

Focused-Coverage by Mobile Sensor Networks. - Xu Li 001; Hannes Frey; Nicola Santoro; Ivan Stojmenovic (MASS, 2009)

Distributed Facility Location for Sensor Network Maintenance. - Elio Velazquez; Nicola Santoro (MSN, 2009)

Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing. - Nicola Santoro (DISC, 2009)

Fault-Tolerant Sequential Scan. - Paola Flocchini; Andrzej Pelc; Nicola Santoro (Theory Comput. Syst., 2009)

Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks. - Xu Li 001; Nicola Santoro; Ivan Stojmenovic (IEEE Trans. Computers, 2009)

Mapping an Unfriendly Subway System. - Paola Flocchini; Matthew Kellett; Peter C. Mason; Nicola Santoro (FUN, 2010)

Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility. - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (IFIP TCS, 2010)

Mobility-Based Strategies for Energy Restoration in Wireless Sensor Networks. - Elio Velazquez; Nicola Santoro (MSN, 2010)

On the Message Complexity of Global Computations. - Doron Nussbaum; Nicola Santoro (OPODIS, 2010)

On the computational power of oblivious robots: forming a series of geometric patterns. - Shantanu Das 001; Paola Flocchini; Nicola Santoro; Masafumi Yamashita (PODC, 2010)

Pro-active Strategies for the Frugal Feeding Problem in Wireless Sensor Networks. - Elio Velazquez; Nicola Santoro; Mark Lanthier (S-CUBE, 2010)

Network Exploration by Silent and Oblivious Robots. - Jérémie Chalopin; Paola Flocchini; Bernard Mans; Nicola Santoro (WG, 2010)

From P2P to reliable semantic P2P systems. - Abdul-Rahman Mawlood-Yunis; Michael Weiss 001; Nicola Santoro (Peer-to-Peer Netw. Appl., 2010)

Remembering without memory: Tree exploration by asynchronous oblivious robots. - Paola Flocchini; David Ilcinkas; Andrzej Pelc; Nicola Santoro (Theor. Comput. Sci., 2010)

Neighbour Selection and Sensor Knowledge: Proactive Approach for the Frugal Feeding Problem in Wireless Sensor Networks. - Elio Velazquez; Nicola Santoro (ADHOCNETS, 2011)

On the temporal analysis of scientific network evolution. - Frédéric Amblard; Arnaud Casteigts; Paola Flocchini; Walter Quattrociocchi; Nicola Santoro (CASoN, 2011)

Improving the Optimal Bounds for Black Hole Search in Rings. - Balasingham Balamohan; Paola Flocchini; Ali Miri; Nicola Santoro (SIROCCO, 2011)

Computing in Time-Varying Networks. - Nicola Santoro (SSS, 2011)

Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics - Nicola Santoro; Walter Quattrociocchi; Paola Flocchini; Arnaud Casteigts; Frédéric Amblard (CoRR, 2011)

Time Optimal Algorithms for Black Hole Search in Rings. - Balasingham Balamohan; Paola Flocchini; Ali Miri; Nicola Santoro (Discret. Math. Algorithms Appl., 2011)

Uniform Scattering of Autonomous Mobile Robots in a Grid. - Lali Barrière; Paola Flocchini; Eduardo Mesa Barrameda; Nicola Santoro (Int. J. Found. Comput. Sci., 2011)

How many oblivious robots can explore a line. - Paola Flocchini; David Ilcinkas; Andrzej Pelc; Nicola Santoro (Inf. Process. Lett., 2011)

A Reference Model for Semantic Peer-to-Peer Networks. - Abdul-Rahman Mawlood-Yunis; Michael Weiss 001; Nicola Santoro (J. Data Semant., 2011)

Efficient, Decentralized Computation of the Topology of Spatial Regions. - Matt Duckham; Doron Nussbaum; Jörg-Rüdiger Sack; Nicola Santoro (IEEE Trans. Computers, 2011)

A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree. - Beat Gfeller; Nicola Santoro; Peter Widmayer (IEEE Trans. Dependable Secur. Comput., 2011)

Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage. - Xu Li 001; Hannes Frey; Nicola Santoro; Ivan Stojmenovic (IEEE Trans. Mob. Comput., 2011)

Computing by Mobile Robotic Sensors. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Theoretical Aspects of Distributed Computing in Sensor Networks, 2011)

Distributed Security Algorithms for Mobile Agents. - Paola Flocchini; Nicola Santoro (Mobile Agents in Networking and Distributed Computing, 2012)

Finding Good Coffee in Paris. - Paola Flocchini; Matthew Kellett; Peter C. Mason; Nicola Santoro (FUN, 2012)

The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Masafumi Yamashita (ICDCS, 2012)

Brief announcement: waiting in dynamic networks. - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (PODC, 2012)

Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles. - Balasingham Balamohan; Stefan Dobrev; Paola Flocchini; Nicola Santoro (SIROCCO, 2012)

Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents. - Paola Flocchini; Matthew Kellett; Peter C. Mason; Nicola Santoro (SSS, 2012)

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles. - Paola Flocchini; David Ilcinkas; Nicola Santoro (Algorithmica, 2012)

Building Fastest Broadcast Trees in Periodically-Varying Graphs - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (CoRR, 2012)

Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (CoRR, 2012)

A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (CoRR, 2012)

Connected graph searching. - Lali Barrière; Paola Flocchini; Fedor V. Fomin; Pierre Fraigniaud; Nicolas Nisse; Nicola Santoro; Dimitrios M. Thilikos (Inf. Comput., 2012)

Searching for Black Holes in Subways. - Paola Flocchini; Matthew Kellett; Peter C. Mason; Nicola Santoro (Theory Comput. Syst., 2012)

Time-varying graphs and dynamic networks. - Arnaud Casteigts; Paola Flocchini; Walter Quattrociocchi; Nicola Santoro (Int. J. Parallel Emergent Distributed Syst., 2012)

Distributed Computing by Mobile Robots: Gathering. - Mark Cieliebak; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (SIAM J. Comput., 2012)

Distributed Minimum Spanning Tree Maintenance for Transient Node Failures. - Paola Flocchini; Toni Mesa Enriquez; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (IEEE Trans. Computers, 2012)

Distributed Computing by Oblivious Mobile Robots - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Morgan & Claypool Publishers, 2012)

Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes. - Eduardo Mesa Barrameda; Shantanu Das 001; Nicola Santoro (ALGOSENSORS, 2013)

Optimal Network Decontamination with Threshold Immunity. - Paola Flocchini; Fabrizio Luccio; Linda Pagli; Nicola Santoro (CIAC, 2013)

Network Decontamination from a Black Virus. - Jie Cai; Paola Flocchini; Nicola Santoro (IPDPS Workshops, 2013)

Rendezvous of Two Robots with Constant Memory. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (SIROCCO, 2013)

Mobility and Computations: Some Open Research Directions. - Nicola Santoro (WALCOM, 2013)

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. - Paola Flocchini; David Ilcinkas; Andrzej Pelc; Nicola Santoro (Algorithmica, 2013)

Exploring an unknown dangerous graph using tokens. - Stefan Dobrev; Paola Flocchini; Rastislav Královic; Nicola Santoro (Theor. Comput. Sci., 2013)

On the exploration of time-varying networks. - Paola Flocchini; Bernard Mans; Nicola Santoro (Theor. Comput. Sci., 2013)

The Mutual Visibility Problem for Oblivious Robots. - Giuseppe Antonio Di Luna; Paola Flocchini; Federico Poloni; Nicola Santoro; Giovanni Viglietta (CCCG, 2014)

Synchronized Dancing of Oblivious Chameleons. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (FUN, 2014)

Sensor deployment by a robot in an unknown orthogonal region: Achieving full coverage. - Eduardo Mesa Barrameda; Nicola Santoro; Wei Shi 001; Najmeh Taleb (ICPADS, 2014)

Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (OPODIS, 2014)

Distributed Barrier Coverage with Relocatable Sensors. - Mohsen Eftekhari Hesari; Paola Flocchini; Lata Narayanan; Jaroslav Opatrny; Nicola Santoro (SIROCCO, 2014)

Robots with Lights: Overcoming Obstructed Visibility Without Colliding. - Giuseppe Antonio Di Luna; Paola Flocchini; Sruti Gan Chaudhuri; Nicola Santoro; Giovanni Viglietta (SSS, 2014)

Decontaminating a Network from a Black Virus. - Jie Cai; Paola Flocchini; Nicola Santoro (Int. J. Netw. Comput., 2014)

Measuring Temporal Lags in Delay-Tolerant Networks. - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (IEEE Trans. Computers, 2014)

Distributed Black Virus Decontamination and Rooted Acyclic Orientations. - Jie Cai; Paola Flocchini; Nicola Santoro (CIT/IUCC/DASC/PICom, 2015)

Time to Change: On Distributed Computing in Dynamic Networks (Keynote). - Nicola Santoro (OPODIS, 2015)

Black Virus Decontamination in Arbitrary Networks. - Jie Cai; Paola Flocchini; Nicola Santoro (WorldCIST (1), 2015)

Forming sequences of geometric patterns with oblivious mobile robots. - Shantanu Das 001; Paola Flocchini; Nicola Santoro; Masafumi Yamashita (Distributed Comput., 2015)

Shortest, Fastest, and Foremost Broadcast in Dynamic Networks. - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (Int. J. Found. Comput. Sci., 2015)

On the expressivity of time-varying graphs. - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (Theor. Comput. Sci., 2015)

A Rupestrian Algorithm. - Giuseppe Antonio Di Luna; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (FUN, 2016)

On the Complexity of Distributed Wake-Up. - Stefan Dobrev; Rastislav Kralovic; Nicola Santoro (CANDAR, 2016)

Live Exploration of Dynamic Rings. - Giuseppe Antonio Di Luna; Stefan Dobrev; Paola Flocchini; Nicola Santoro (ICDCS, 2016)

Universal Systems of Oblivious Mobile Robots. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (SIROCCO, 2016)

Implicit Function Computation by Oblivious Mobile Robots. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (CoRR, 2016)

Network decontamination under m-immunity. - Paola Flocchini; Fabrizio Luccio; Linda Pagli; Nicola Santoro (Discret. Appl. Math., 2016)

Autonomous mobile robots with lights. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Masafumi Yamashita (Theor. Comput. Sci., 2016)

Exploring an unknown dangerous graph with a constant number of tokens. - Balasingham Balamohan; Stefan Dobrev; Paola Flocchini; Nicola Santoro (Theor. Comput. Sci., 2016)

Rendezvous with constant memory. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (Theor. Comput. Sci., 2016)

On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. - Giuseppe Antonio Di Luna; Paola Flocchini; Taisuke Izumi; Tomoko Izumi; Nicola Santoro; Giovanni Viglietta (ICDCS, 2017)

Mediated Population Protocols: Leader Election and Applications. - Shantanu Das 001; Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta (TAMC, 2017)

Brief Announcement: Shape Formation by Programmable Particles. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Yukiko Yamauchi (DISC, 2017)

Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (CoRR, 2017)

Distributed computing by mobile robots: uniform circle formation. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (Distributed Comput., 2017)

Mutual visibility by luminous robots without collisions. - Giuseppe Antonio Di Luna; Paola Flocchini; Sruti Gan Chaudhuri; Federico Poloni; Nicola Santoro; Giovanni Viglietta (Inf. Comput., 2017)

On the Cost of Waking Up. - Stefan Dobrev; Rastislav Královic; Nicola Santoro (Int. J. Netw. Comput., 2017)

Energy Restoration in a Linear Sensor Network. - Eman Omar; Paola Flocchini; Nicola Santoro (AICCSA, 2018)

Line Recovery by Programmable Particles. - Giuseppe Antonio Di Luna; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (ICDCN, 2018)

Online Energy Restoration by a Mobile Robot in a Ring of Sensors. - Eman Omar; Paola Flocchini; Nicola Santoro (IWCMC, 2018)

Perpetual Energy Restoration by Multiple Mobile Robots in Circular Sensor Networks. - Eman Omar; Paola Flocchini; Nicola Santoro (AICCSA, 2019)

Effective Decentralized Energy Restoration by a Mobile Robot. - Paola Flocchini; Eman Omar; Nicola Santoro (CANDAR, 2019)

Gathering and Election by Mobile Robots in a Continuous Cycle. - Paola Flocchini; Ryan Killick; Evangelos Kranakis; Nicola Santoro; Masafumi Yamashita (ISAAC, 2019)

Oblivious Permutations on the Plane. - Shantanu Das 001; Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (OPODIS, 2019)

On Memory, Communication, and Synchronous Schedulers When Moving and Computing. - Paola Flocchini; Nicola Santoro; Koichi Wada 001 (OPODIS, 2019)

Tight Bounds on Distributed Exploration of Temporal Graphs. - Tsuyoshi Gotoh; Paola Flocchini; Toshimitsu Masuzawa; Nicola Santoro (OPODIS, 2019)

Real-time Outlier Detection Over Streaming Data. - Kangqing Yu; Wei Shi 001; Nicola Santoro; Xiangyu Ma (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI, 2019)

Population protocols with faulty interactions: The impact of a leader. - Giuseppe Antonio Di Luna; Paola Flocchini; Taisuke Izumi; Tomoko Izumi; Nicola Santoro; Giovanni Viglietta (Theor. Comput. Sci., 2019)

Moving and Computing Models: Agents. - Shantanu Das 001; Nicola Santoro (Distributed Computing by Mobile Entities, 2019)

Moving and Computing Models: Robots. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Distributed Computing by Mobile Entities, 2019)

Mobile RAM and Shape Formation by Programmable Particles. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Yukiko Yamauchi (Euro-Par, 2020)

Weak robots performing conflicting tasks without knowing who is in their team. - Subhash Bhagat; Paola Flocchini; Krishnendu Mukhopadhyaya; Nicola Santoro (ICDCN, 2020)

Achieving Immortality in Wireless Rechargeable Sensor Networks Using Local Learning. - Osama I. Aloqaily; Paola Flocchini; Nicola Santoro (ISNCC, 2020)

Line Reconfiguration by Programmable Particles Maintaining Connectivity. - Nooshin Nokhanji; Nicola Santoro (TPNC, 2020)

Forming Sequences of Patterns With Luminous Robots. - Shantanu Das 001; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (IEEE Access, 2020)

Tight Bounds for Black Hole Search in Dynamic Rings. - Giuseppe Antonio Di Luna; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (CoRR, 2020)

Synchronization by Asynchronous Mobile Robots with Limited Visibility. - Paola Flocchini; Nicola Santoro; Masafumi Yamashita; Yukiko Yamauchi (CoRR, 2020)

Distributed exploration of dynamic rings. - Giuseppe Antonio Di Luna; Stefan Dobrev; Paola Flocchini; Nicola Santoro (Distributed Comput., 2020)

Fault-tolerant simulation of population protocols. - Giuseppe Antonio Di Luna; Paola Flocchini; Taisuke Izumi; Tomoko Izumi; Nicola Santoro; Giovanni Viglietta (Distributed Comput., 2020)

Shape formation by programmable particles. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Yukiko Yamauchi (Distributed Comput., 2020)

Meeting in a polygon by anonymous oblivious robots. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (Distributed Comput., 2020)

Effective Energy Restoration of Wireless Sensor Networks by a Mobile Robot. - Paola Flocchini; Eman Omar; Nicola Santoro (Int. J. Netw. Comput., 2020)

Designing a Streaming Algorithm for Outlier Detection in Data Mining - An Incrementa Approach. - Kangqing Yu; Wei Shi 001; Nicola Santoro (Sensors, 2020)

Gathering in dynamic rings. - Giuseppe Antonio Di Luna; Paola Flocchini; Linda Pagli; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (Theor. Comput. Sci., 2020)

Self-Repairing Line of Metamorphic Robots. - Nooshin Nokhanji; Nicola Santoro (ICARA, 2021)

Black Hole Search in Dynamic Rings. - Giuseppe Antonio Di Luna; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (ICDCS, 2021)

Autonomous Mobile Robots: Refining the Computational Landscape. - Kevin Buchin; Paola Flocchini; Irina Kostitsyna; Tom Peters; Nicola Santoro; Koichi Wada 001 (IPDPS Workshops, 2021)

Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. - David G. Kirkpatrick; Irina Kostitsyna; Alfredo Navarra; Giuseppe Prencipe; Nicola Santoro (PODC, 2021)

Exploration of dynamic networks: Tight bounds on the number of agents. - Tsuyoshi Gotoh; Paola Flocchini; Toshimitsu Masuzawa; Nicola Santoro (J. Comput. Syst. Sci., 2021)

On synchronization and orientation in distributed barrier coverage with relocatable sensors. - Mohsen Eftekhari; Paola Flocchini; Lata Narayanan; Jaroslav Opatrny; Nicola Santoro (Theor. Comput. Sci., 2021)

Fully Dynamic Line Maintenance by a Simple Robot. - Nooshin Nokhanji; Paola Flocchini; Nicola Santoro (ICARA, 2022)

Fully Dynamic Line Maintenance by Hybrid Programmable Matter. - Nooshin Nokhanji; Paola Flocchini; Nicola Santoro (IPDPS Workshops, 2022)

On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis. - Kevin Buchin; Paola Flocchini; Irina Kostitsyna; Tom Peters; Nicola Santoro; Koichi Wada 001 (SIROCCO, 2022)

TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta (Distributed Comput., 2022)

A New Oral Model to Assess Postprandial Lactate Production Rate. - Jacopo Bonet; Brittany Galuppo; Nicola Santoro; Chiara Dalla Man (IEEE Trans. Biomed. Eng., 2022)

On Asynchrony, Memory, and Communication: Separations and Landscapes. - Paola Flocchini; Nicola Santoro; Yuichi Sudo; Koichi Wada 001 (OPODIS, 2023)

Black Hole Search in Dynamic Rings: The Scattered Case. - Giuseppe Antonio Di Luna; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (OPODIS, 2023)

Cops & Robber on Periodic Temporal Graphs: Characterization and Improved Bounds. - Jean-Lou De Carufel; Paola Flocchini; Nicola Santoro; Frédéric Simard (SIROCCO, 2023)

Asynchronous Gathering in a Dangerous Ring. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Algorithms, 2023)

Copnumbers of periodic graphs. - Jean-Lou De Carufel; Paola Flocchini; Nicola Santoro; Frédéric Simard (CoRR, 2023)

Dynamic Line Maintenance by Hybrid Programmable Matter. - Nooshin Nokhanji; Paola Flocchini; Nicola Santoro (Int. J. Netw. Comput., 2023)

Variations on the Tournament Problem. - Fabrizio Luccio; Linda Pagli; Nicola Santoro (FUN, 2024)

The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. - Paola Flocchini; Debasish Pattanayak; Nicola Santoro; Masafumi Yamashita (IWOCA, 2024)

Keynote: Time is not a Healer: Before and After. - Nicola Santoro (PODC, 2024)

Black Hole Search by a Set of Scattered Agents in Dynamic Rings. - Giuseppe Antonio Di Luna; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (CoRR, 2024)

Cops & Robber on Periodic Temporal Graphs. - Jean-Lou De Carufel; Paola Flocchini; Nicola Santoro; Frédéric Simard (CoRR, 2024)

On the power of bounded asynchrony: convergence by autonomous robots with limited visibility. - David G. Kirkpatrick; Irina Kostitsyna; Alfredo Navarra; Giuseppe Prencipe; Nicola Santoro (Distributed Comput., 2024)

Explicit Token-Based Communication for Mobile Entities. - Balasingham Balamohan; Stefan Dobrev; Paola Flocchini; Nicola Santoro (SIROCCO, 2025)

Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation. - Paola Flocchini; Alfredo Navarra; Debasish Pattanayak; Francesco Piselli; Nicola Santoro (SIROCCO, 2025)

On the computational power of energy-constrained mobile robots. - Kevin Buchin; Paola Flocchini; Irina Kostitsyna; Tom Peters; Nicola Santoro; Koichi Wada 001 (Inf. Comput., 2025)

Asynchronous Separation of Unconscious Colored Robots. - Paola Flocchini; Debasish Pattanayak; Francesco Piselli; Nicola Santoro; Yukiko Yamauchi (Int. J. Netw. Comput., 2025)

Locating a black hole in a dynamic ring. - Giuseppe Antonio Di Luna; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (J. Parallel Distributed Comput., 2025)

Universal Dancing by Luminous Robots under Sequential Schedulers. - Caterina Feletti; Paola Flocchini; Debasish Pattanayak; Giuseppe Prencipe; Nicola Santoro (CoRR, 2025)