Nicola Santoro

Nicola Santoro's AcademicInfluence.com Rankings

Nicola Santoro

Computer Science

#8450

World Rank

#8883

Historical Rank

computer-science Degrees

Nicola Santoro

Mathematics

#7141

World Rank

#9767

Historical Rank

Graph Theory

#93

World Rank

#101

Historical Rank

Measure Theory

#1898

World Rank

#2313

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Nicola Santoro Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Nicola Santoro's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Time-varying graphs and dynamic networks (2010) (710)
Gathering of asynchronous robots with limited visibility (2005) (367)
Labelling and Implicit Routing in Networks (1985) (352)
Distributed Computing by Oblivious Mobile Robots (2012) (263)
Design and analysis of distributed algorithms (2006) (223)
Time is Not a Healer (1989) (209)
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots (2008) (202)
Solving the Robots Gathering Problem (2003) (190)
Distributed Computing by Mobile Robots: Gathering (2012) (181)
Min-max heaps and generalized priority queues (1986) (179)
Capture of an intruder by mobile agents (2002) (173)
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots (1999) (138)
Distributed coordination of a set of autonomous mobile robots (2000) (132)
Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage (2011) (123)
Mobile agent rendezvous in a ring (2003) (121)
Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics (2011) (116)
Mobile Search for a Black Hole in an Anonymous Ring (2001) (114)
Autonomous mobile robots with lights (2016) (112)
Gathering of Asynchronous Oblivious Robots with Limited Visibility (2001) (108)
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots (2007) (105)
Optimal Parallel Merging and Sorting Without Memory Conflicts (1987) (95)
Distributed algorithms for finding centers and medians in networks (1984) (94)
Searching for a black hole in arbitrary networks: optimal mobile agents protocols (2006) (94)
On time versus size for monotone dynamic monopolies in regular topologies (2003) (93)
Dynamic monopolies in tori (2004) (85)
Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks (2009) (84)
Remembering without memory: Tree exploration by asynchronous oblivious robots (2008) (84)
Multiple Mobile Agent Rendezvous in a Ring (2004) (83)
Cellular automata in fuzzy backgrounds (1997) (83)
Searching Is Not Jumping (2003) (82)
Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters (1986) (76)
Agreement in synchronous networks with ubiquitous faults (2007) (76)
Self-deployment of mobile sensors on a ring (2008) (75)
Map construction of unknown graphs by multiple agents (2007) (73)
Convergence and aperiodicity in fuzzy cellular automata: Revisiting rule 90 (1998) (71)
Sense of direction, topological awareness and communication complexity (1984) (71)
Sense of direction: Definitions, properties, and classes (1998) (67)
Mesh-Based Sensor Relocation for Coverage Maintenance in Mobile Sensor Networks (2007) (66)
Forming sequences of geometric patterns with oblivious mobile robots (2015) (64)
On the exploration of time-varying networks (2013) (64)
Searching for a black hole in arbitrary networks: optimal mobile agent protocols (2002) (63)
Distributed Computing by Mobile Entities (2019) (62)
Uniform scattering of autonomous mobile robots in a grid (2009) (62)
Mutual visibility by luminous robots without collisions (2015) (61)
Multiple Agents RendezVous in a Ring in Spite of a Black Hole (2003) (60)
Black hole search in common interconnection networks (2006) (60)
Sense of direction in distributed computing (1998) (58)
Exploration of Periodically Varying Graphs (2009) (55)
Shape formation by programmable particles (2017) (55)
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction (2007) (55)
On the computational power of oblivious robots: forming a series of geometric patterns (2010) (54)
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP (1997) (51)
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links (2007) (51)
Measuring Temporal Lags in Delay-Tolerant Networks (2011) (50)
Optimal irreversible dynamos in chordal rings (1999) (49)
The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits (2012) (49)
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility (2010) (47)
Searching for Black Holes in Subways (2011) (47)
Focused-coverage by mobile sensor networks (2009) (47)
Can we elect if we cannot compare? (2003) (46)
Distributed Algorithms for Autonomous Mobile Robots (2006) (45)
Network Exploration by Silent and Oblivious Robots (2010) (44)
Distributed computing by mobile robots: uniform circle formation (2014) (43)
Distributed Sorting (1985) (43)
Trade-Offs in Non-Reversing Diameter (1994) (42)
Connected graph searching (2012) (42)
ZONER: A ZONE-based Sensor Relocation Protocol for Mobile Sensor Networks (2006) (42)
Distributed Function Evaluation in the Presence of Transmission Faults (1990) (42)
On the Impact of Sense of Direction on Message Complexity (1997) (40)
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks (2012) (40)
Network decontamination in Presence of Local Immunity (2007) (39)
Localized sensor self-deployment with coverage guarantee (2008) (38)
Sorting and election in anonymous asynchronous rings (2004) (37)
Black Hole Search in Asynchronous Rings Using Tokens (2006) (37)
Rendezvous with constant memory (2016) (37)
Pattern Formation by Anonymous Robots Without Chirality (2001) (36)
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles (2012) (36)
Robots with Lights: Overcoming Obstructed Visibility Without Colliding (2014) (35)
Map construction and exploration by mobile agents scattered in a dangerous network (2009) (35)
Sense of Direction: Formal Definitions and Properties (1994) (34)
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing) (2006) (34)
Rendezvous of Two Robots with Constant Memory (2013) (32)
Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens (2008) (31)
Fault-intolerance of reconfigurable systolic arrays (1990) (31)
Exploring an Unknown Graph to Locate a Black Hole Using Tokens (2006) (31)
The Mutual Visibility Problem for Oblivious Robots (2014) (31)
Improved Bounds for Optimal Black Hole Search with a Network Map (2004) (31)
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem (2014) (29)
Gathering in Dynamic Rings (2017) (29)
Effective Elections for Anonymous Mobile Agents (2006) (29)
Distributed Exploration of an Unknown Graph (2005) (29)
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively (2006) (29)
A Distributed Selection Algorithm and its Expected Communication Complexity (1992) (28)
On the temporal analysis of scientific network evolution (2011) (28)
Live Exploration of Dynamic Rings (2015) (28)
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments (2008) (28)
How many oblivious robots can explore a line (2011) (27)
Mobile Agents Rendezvous When Tokens Fail (2004) (27)
Computing all the best swap edges distributively (2004) (27)
Distributed Security Algorithms by Mobile Agents (2006) (26)
Exploring an unknown dangerous graph using tokens (2013) (26)
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens (2008) (26)
Self-deployment Algorithms for Mobile Sensors on a Ring (2006) (26)
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree (2011) (24)
Guarding rectangular art galleries (1994) (24)
On the expressivity of time-varying graphs (2013) (24)
An Integrated Self-deployment and Coverage Maintenance Scheme for Mobile Sensor Networks (2006) (23)
Irreversible Dynamos in Tori (1998) (23)
Line Recovery by Programmable Particles (2017) (22)
Tree Decontamination with Temporary Immunity (2008) (22)
Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes (2013) (21)
Time Optimal Algorithms for Black Hole Search in Rings (2010) (21)
Designing a Streaming Algorithm for Outlier Detection in Data Mining—An Incremental Approach † (2020) (21)
On the longest increasing subsequence of a circular list (2007) (21)
Efficient, Decentralized Computation of the Topology of Spatial Regions (2011) (21)
Efficient Distributed Selection with Bounded Messages (1997) (21)
Order statistics on distributed sets (1982) (20)
A Practical Algorithm for Boolean Matrix Multiplication (1988) (20)
Computing by Mobile Robotic Sensors (2011) (20)
Interpolation-Binary Search (1985) (19)
Reduction Techniques for Selection in Distributed Files (1989) (19)
Shout echo selection in distributed files (1986) (18)
On the impact of sense of direction in arbitrary networks (1994) (18)
Decontaminating a Network from a Black Virus (2014) (18)
Distributed election in a circle without a global sense of orientation (1984) (18)
Mapping an Unfriendly Subway System (2010) (17)
Black Hole Search by Mobile Agents in Hypercubes and Related Networks (2002) (17)
Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search (2006) (17)
On the Expected Complexity of Distributed Selection (1988) (17)
Scattered Black Hole Search in an Oriented Ring using Tokens (2007) (17)
Guessing Games and Distributed Computations in Synchronous Networks (1987) (17)
Distributed exploration of dynamic rings (2018) (17)
Time-Message Trade-Offs for the Weak Unison Problem (1994) (17)
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures (2012) (16)
Analysis of a Distributed Algorithm for Extrema Finding in a Ring (1987) (16)
Connected and internal graph searching (2002) (15)
Election and Rendezvous in Fully Anonymous Systems with Sense of Direction (2003) (15)
Network decontamination with local immunization (2006) (15)
Moving and Computing Models: Robots (2019) (14)
Angle orders, regular n-gon orders and the crossing number (1987) (14)
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays (1993) (14)
Localized Sensor Self-Deployment for Guaranteed Coverage Radius Maximization (2009) (14)
Optimal fault-tolerant leader election in chordal rings (1994) (14)
Breaking Symmetry in Synchronous Networks (1986) (14)
Population Protocols with Faulty Interactions: The Impact of a Leader (2016) (14)
Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents (2007) (14)
Fuzzy cellular automata and their 'chaotic behavior' (1993) (14)
From P2P to reliable semantic P2P systems (2010) (13)
Optimal VLSI Dictionary Machines on Meshes (1987) (13)
Distributed Computations by Autonomous Mobile Robots (2001) (13)
Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles (2012) (13)
Synchronized Dancing of Oblivious Chameleons (2014) (13)
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents (2007) (13)
Improving the Optimal Bounds for Black Hole Search in Rings (2011) (12)
Topological Constraints for Sense of Direction (1998) (12)
Backward consistency and sense of direction in advanced distributed systems (1999) (12)
Distributed Barrier Coverage with Relocatable Sensors (2014) (12)
Monotone Dynamos in Tori (1999) (12)
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults (2005) (12)
Efficient elections in chordal ring networks (1989) (12)
Distributed Security Algorithms for Mobile Agents (2012) (12)
Optimal Elections in Faulty Loop Networks and Applications (1998) (12)
Groupings and Pairings in Anonymous Networks (2006) (11)
Tight Bounds on Distributed Exploration of Temporal Graphs (2019) (11)
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications (2017) (11)
Network Decontamination from a Black Virus (2013) (11)
Symmetries and Sense of Direction in Labeled Graphs (1998) (10)
Localized distance-sensitive service discovery in wireless sensor networks (2008) (10)
Sensor deployment by a robot in an unknown orthogonal region: Achieving full coverage (2014) (10)
On Memory, Communication, and Synchronous Schedulers When Moving and Computing (2020) (10)
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy (1996) (10)
Foundations of Information Technology in the Era of Network and Mobile Computing (2002) (10)
Finding Good Coffee in Paris (2012) (9)
Chain mulitplication of matrices of approximately or exactly the same size (1984) (9)
Localized Self-Deployment of Mobile Sensors for Optimal Focused-Coverage Formation ( Technical Report ) (2007) (9)
Exploring an unknown dangerous graph with a constant number of tokens (2016) (9)
Algorithms and Data Structures (2002) (9)
An improved testing scheme for catastrophic fault patterns (2000) (9)
Distributed Facility Location for Sensor Network Maintenance (2009) (9)
Issues for Robust Consensus Building in P2P Networks (2006) (8)
Mobile RAM and Shape Formation by Programmable Particles (2020) (8)
Mobility-Based Strategies for Energy Restoration in Wireless Sensor Networks (2010) (8)
On the message complexity of distributed problems (1984) (8)
An improved algorithm for Boolean matrix multiplication (1986) (8)
Comparing performance of two mobile agent platforms in distributed search (2004) (8)
Computing on a Systolic Screen: Hulls, Contours and Applications (1987) (8)
Meeting in a polygon by anonymous oblivious robots (2017) (8)
Proceedings of the second annual ACM symposium on Principles of distributed computing (1983) (8)
Network decontamination via local immunization (2006) (7)
Time to Change: On Distributed Computing in Dynamic Networks (Keynote) (2015) (7)
Distributed Computation of All Node Replacements of a Minimum Spanning Tree (2007) (7)
Bounds on performance of VLSI processor arrays (1991) (7)
Extending the Four Russians' Bound to General Matrix Multiplication (1980) (7)
Distributed Control of Updates in Multiple-Copy Databases: A Time Optimal Algorithm (1979) (7)
Optimal Network Decontamination with Threshold Immunity (2013) (7)
Brief Announcement: Shape Formation by Programmable Particles (2017) (7)
Forming Sequences of Patterns With Luminous Robots (2020) (7)
Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents (2012) (7)
Sums of lexicographically ordered sets (1990) (7)
On Fractional Dynamic Faults with Threshold (2006) (7)
Pattern Formation by Autonomous Mobile Robots (2006) (7)
Black hole search in the network and subway models (2012) (6)
Improving Semi-Join Evaluation in Distributed Query Processing (1987) (6)
Real-time Outlier Detection Over Streaming Data (2019) (6)
Fault Classification in P2P Semantic Mapping (2006) (6)
A new classification of cellular automata and their algebraic properties (1993) (6)
Sorting multisets in anonymous rings (2000) (6)
Finding the Extrema of a Distributed Multiset (1994) (6)
Mediated Population Protocols: Leader Election and Applications (2017) (6)
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays with bidirectional links (1992) (5)
Network decontamination under m-immunity (2016) (5)
A Reference Model for Semantic Peer-to-Peer Networks (2009) (5)
The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence (1992) (5)
SENSE OF DIRECTION AND COMMUNICATION COMPLEXITY IN DISTRIBUTED NETWORKS (2004) (5)
Black Virus Decontamination in Arbitrary Networks (2015) (5)
Geometric Containment and Partial Orders (1989) (5)
Geometric Containment and Vector Dominance (1987) (5)
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots (2012) (5)
Efficient token-based control in rings (1996) (5)
On the Complexity of Testing for Catastrophic Faults (1995) (5)
TIME vs BITS (1989) (4)
CA-Like Error Propagation in Fuzzy CA (1997) (4)
Computational geometry algorithms for the systolic screen (1991) (4)
Proceedings of the 4th International Workshop on Distributed Algorithms (1987) (4)
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree (2004) (4)
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols (2016) (4)
Autonomous Mobile Robots: Refining the Computational Landscape (2021) (4)
Tight Bounds for the Rectangualr Art Gallery Problem (1991) (4)
Alternative Date Gathering Schemes for Wireless Sensor Networks (2008) (4)
Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility (2021) (4)
Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract) (1992) (4)
Online Energy Restoration by a Mobile Robot in a Ring of Sensors (2018) (4)
Chaos and subshift rules in neural networks and cellular automata (1993) (4)
Geometric Containment is not Reducible to Pareto Dominance (1985) (3)
Building Fastest Broadcast Trees in Periodically-Varying Graphs (2012) (3)
On the Performance of Distributed Search by Mobile Agents (2004) (3)
Energy Restoration in a Linear Sensor Network (2018) (3)
Distributed Black Virus Decontamination and Rooted Acyclic Orientations (2015) (3)
Pro-active Strategies for the Frugal Feeding Problem in Wireless Sensor Networks (2010) (3)
Asynchronous to Synchronous transformations (2000) (3)
Black Hole Search in Dynamic Rings (2021) (3)
Weak robots performing conflicting tasks without knowing who is in their team (2020) (3)
Full Table Search by Polynomial Functions (1976) (3)
A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast (2012) (3)
Line Reconfiguration by Programmable Particles Maintaining Connectivity (2020) (3)
Improved bounds for electing a leader in a synchronous ring (1997) (3)
Gathering and Election by Mobile Robots in a Continuous Cycle (2019) (3)
Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing (1982) (3)
A Mobile Agent Prototype for Distributed Search (2001) (3)
Chapter 6: Energy Restoration in Mobile Sensor Networks (2014) (2)
Compositional Experimental Analysis of CellularAutomata : Attraction Properties and Logic (1996) (2)
Distributed computing by mobile robots: uniform circle formation (2016) (2)
Distributed computing on oriented anonymous hypercubes with faulty components (2001) (2)
On synchronization and orientation in distributed barrier coverage with relocatable sensors (2021) (2)
Fault-Tolerant Sequential Scan (2009) (2)
On the integer complexity of Boolean matrix multiplication (1986) (2)
Distributed Computing Environments (2006) (2)
On the Complexity of Decontaminating an Hexagonal Mesh Network (2007) (2)
On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis (2022) (2)
Advances in parallel and distributed computing models - APDCM (2009) (2)
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks (2012) (2)
On fractional dynamic faults with thresholds (2008) (2)
On Reliability Analysis of Chordal Rings (1995) (2)
Optimal Mobile Agent Protocols for Searching a Black Hole in Arbitrary Networks (2004) (2)
Searching for Black Holes in Subways (2011) (2)
Tight Bounds for Synchronous Communication of Information Using Bits, Silence (2003) (2)
Computing in Time-Varying Networks (2011) (2)
The un-merging problem (1985) (2)
Fault-tolerant simulation of population protocols (2020) (2)
Self-Repairing Line of Metamorphic Robots (2021) (2)
Moving and Computing Models: Agents (2019) (2)
Efficient reconfiguration technique for redundant ring networks (1995) (2)
Uniquely colourable m-dichromatic oriented graphs (1986) (1)
Decontamination of an Arbitrary Network from Multiple Black Viruses (2017) (1)
(Time × Space)-Efficient Implementations of Hierarchical Conceptual Models (1988) (1)
Solving Distributed Mutual Exclusion using Cooperating Mobile Agents (2006) (1)
Levels of Sense of Direction in Distributed Systems (1997) (1)
On the Cost of Waking Up (2017) (1)
Sorting Multisets and Electing a Leader in Anonymous Rings (2000) (1)
On the Packet Complexity of Distributed Selection (1987) (1)
Achieving Immortality in Wireless Rechargeable Sensor Networks Using Local Learning (2020) (1)
Exploring trees by teams of asynchronous oblivious robots (2008) (1)
Neighbour Selection and Sensor Knowledge: Proactive Approach for the Frugal Feeding Problem in Wireless Sensor Networks (2011) (1)
Fault Classification in P 2 P Semantic Mapping (2006) (1)
Brief announcement: waiting in dynamic networks (2012) (1)
Oblivious Permutations on the Plane (2019) (1)
A Rupestrian Algorithm (2016) (1)
On Finding Minimum Deadly Sets for Directed Networks (2001) (1)
Effective Energy Restoration of Wireless Sensor Networks by a Mobile Robot (2020) (1)
Distributed Exploration of Anonymous Graphs by Multiple Agents ∗ (2006) (1)
Geometric containment and Pareto dominance (1985) (1)
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree (2007) (1)
Effective Decentralized Energy Restoration by a Mobile Robot (2019) (1)
Shape formation by programmable particles (2019) (1)
Ring exploration by a team of asynchronous oblivious robots (2007) (1)
Wiley Series on Parallel and Distributed Computing (2006) (1)
Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings (2009) (1)
Exploration of dynamic networks: Tight bounds on the number of agents (2021) (1)
Ring reconfiguration in presence of close fault cuts (1996) (1)
Structural Information and Communication Complexity, 1st International Colloquium, SIROCCO 1994, Carleton University, Ottawa, Canada, May 18-20, 1994, Proceedings (1995) (0)
Perpetual Energy Restoration by Multiple Mobile Robots in Circular Sensor Networks (2019) (0)
Order and Balance in Continuously-Fault-Tolerant Distributions of Objects (2006) (0)
Mobile Entities Computing: Models and Problems (2008) (0)
Forming sequences of geometric patterns with oblivious mobile robots (2014) (0)
Efficient Token-Based Control in Rings (Abstract) (1996) (0)
Proceedings of the 13th International Conference on Principles of Distributed Systems (2009) (0)
Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings (1989) (0)
On hash techniques in a paged environment (1979) (0)
Distributed Data & Structures 2, Records of the 2nd International Meeting (WDAS 1999), Princeton, USA, May 10-11, 1999 (1999) (0)
Experiences with the implementation of geometric algorithms (1995) (0)
Basic Problems and Protocols (2006) (0)
Foundations of Information Technology in the Era of Networking and Mobile Computing, IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), August 25-30, 2002, Montréal, Québec, Canada (2002) (0)
SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity, Siena, Italy, June 6-8, 1996 (1996) (0)
Rendezvous of Mobile Agents in Anonymous Networks with Faulty Channels ∗ (2007) (0)
Efficient robot-based energy maintenance in Wireless Sensor Networks (2010) (0)
Distributed algorithms on graphs : proceedings of the 1st International Workshop on Distributed Algorithms, Ottawa, Canada, August 1985 (1986) (0)
Point-of-Failure Swap Rerouting : Computing The Optimal Swaps Distributively (2005) (0)
Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings (1991) (0)
Distributed Algorithms: 4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings. (1991) (0)
Bounds on Performance of VLSI Processor Arrays (Preliminary Version) (1991) (0)
Network Decontamination under m-Immunity 1 (2015) (0)
Translation Capabilities of Sense of Direction (1995) (0)
Detecting Stable Properties (2006) (0)
On the Microscopic View of Time and Messages (2017) (0)
Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing (2009) (0)
Computing in Presence of Faults (2006) (0)
On the Message Complexity of Global Computations (2010) (0)
Introduction: Distributed Data and Structures 1 (1998) (0)
Operations on permutations and representation in graph form (1976) (0)
Fun with algorithms (2004) (0)
FROM RINGS TO COMPLETE GRAPHS · e ( nlogn ) TO e ( n ) DISTRIBUTED LEADER ELECTI . ON (2012) (0)
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles (2011) (0)
Mobile Agents Computing: Security Issues and Algorithmic Solutions (2005) (0)
Robot Workload Balance for Wireless Sensor Network Maintenance (2010) (0)
Random access in a list environment (1976) (0)
Distributed Set Operations (2006) (0)
Geometric Containment, Common Roots of Polynomials and Partial Orders (1988) (0)
Chapter 1 Energy Restoration in Mobile Sensor Networks (2013) (0)
Asynchronous Gathering in a Dangerous Ring (2023) (0)
Fully Dynamic Line Maintenance by Hybrid Programmable Matter (2022) (0)
Panel on the contributions of the DISC community to distributed computing: a historical perspective (2006) (0)
Universal Systems of Oblivious Mobile Robots (2016) (0)
Distributed Exploration of Unlabelled Graphs by Multiple Agents ∗ (2006) (0)
Biconsistency and Homonymy in Distributed Systems with Edge Symmetry (1999) (0)
Design and Analysis of Distributed Algorithms Chapter 2 : BASIC PROBLEMS AND PROTOCOLS (2005) (0)
Dynamic Line Maintenance by Hybrid Programmable Matter (2023) (0)
Fully Dynamic Line Maintenance by a Simple Robot (2022) (0)
On the Complexity of Distributed Wake-Up (2016) (0)
Tight Bounds for Black Hole Search in Dynamic Rings (2020) (0)
Distributed Data & Structures, Records of the 1st International Meeting (WDAS 1998), Orlando, Florida, USA (1999) (0)
Proceedings of the Third Workshop on Algorithms and Data Structures (1989) (0)
Robots Rendezvous with Constant Memory ∗ (2014) (0)
Generalized Priority Queues (0)
Design and Analysis of Distributed Algorithms Chapter 4: ROUTING (2006) (0)
FUN with Algorithms - Foreword (2002) (0)
Distributed Computing in the Presence of Mobile Faults (2007) (0)
Fault-tolerant simulation of population protocols (2020) (0)
Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs (2007) (0)
Distributed exploration of dynamic rings (2018) (0)
Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing (2002) (0)
Introduction: Distributed Data & Structures 2 (1999) (0)
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27-29, 1984 (1984) (0)
Synchronization by Asynchronous Mobile Robots with Limited Visibility (2020) (0)
Implicit Function Computation by Oblivious Mobile Robots (2016) (0)
Message Routing and Shortest Paths (2006) (0)
Mobility and Computations: Some Open Research Directions (2013) (0)
and Data Structures Min-Max Heaps and (1986) (0)
A Characterization of Semi-Synchrony for Asynchronous Robots with Limited Visibility, and its Application to Luminous Synchronizer Design. (2020) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Nicola Santoro?

Nicola Santoro is affiliated with the following schools:

Carleton University

Nicola Santoro's Academic­Influence.com Rankings

Why Is Nicola Santoro Influential?

Nicola Santoro's Published Works

Published Works

What Schools Are Affiliated With Nicola Santoro?

Nicola Santoro's AcademicInfluence.com Rankings