Nicola Santoro

According to our database1, Nicola Santoro authored at least 289 papers between 1976 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Moving and Computing Models: Robots.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Moving and Computing Models: Agents.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Population protocols with faulty interactions: The impact of a leader.
Theor. Comput. Sci., 2019

2018
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Online Energy Restoration by a Mobile Robot in a Ring of Sensors.
Proceedings of the 14th International Wireless Communications & Mobile Computing Conference, 2018

Line Recovery by Programmable Particles.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

Energy Restoration in a Linear Sensor Network.
Proceedings of the 15th IEEE/ACS International Conference on Computer Systems and Applications, 2018

2017
On the Cost of Waking Up.
IJNC, 2017

Mutual visibility by luminous robots without collisions.
Inf. Comput., 2017

Distributed computing by mobile robots: uniform circle formation.
Distributed Computing, 2017

TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications.
CoRR, 2017

Shape Formation by Programmable Particles.
CoRR, 2017

Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots.
CoRR, 2017

Line-Recovery by Programmable Particles.
CoRR, 2017

Gathering in Dynamic Rings.
CoRR, 2017

Brief Announcement: Shape Formation by Programmable Particles.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Meeting in a Polygon by Anonymous Oblivious Robots.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Mediated Population Protocols: Leader Election and Applications.
Proceedings of the Theory and Applications of Models of Computation, 2017

Gathering in Dynamic Rings.
Proceedings of the Structural Information and Communication Complexity, 2017

Shape Formation by Programmable Particles.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

Population Protocols with Faulty Interactions: The Impact of a Leader.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Rendezvous with constant memory.
Theor. Comput. Sci., 2016

Exploring an unknown dangerous graph with a constant number of tokens.
Theor. Comput. Sci., 2016

Autonomous mobile robots with lights.
Theor. Comput. Sci., 2016

Network decontamination under m-immunity.
Discrete Applied Mathematics, 2016

Population Protocols with Faulty Interactions: the Impact of a Leader.
CoRR, 2016

On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols.
CoRR, 2016

Implicit Function Computation by Oblivious Mobile Robots.
CoRR, 2016

Universal Systems of Oblivious Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2016

Live Exploration of Dynamic Rings.
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

On the Complexity of Distributed Wake-Up.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

A Rupestrian Algorithm.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
On the expressivity of time-varying graphs.
Theor. Comput. Sci., 2015

Shortest, Fastest, and Foremost Broadcast in Dynamic Networks.
Int. J. Found. Comput. Sci., 2015

Forming sequences of geometric patterns with oblivious mobile robots.
Distributed Computing, 2015

Mutual Visibility by Luminous Robots Without Collisions.
CoRR, 2015

Live Exploration of Dynamic Rings.
CoRR, 2015

Black Virus Decontamination in Arbitrary Networks.
Proceedings of the New Contributions in Information Systems and Technologies, 2015

Time to Change: On Distributed Computing in Dynamic Networks (Keynote).
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Distributed Black Virus Decontamination and Rooted Acyclic Orientations.
Proceedings of the 15th IEEE International Conference on Computer and Information Technology, 2015

2014
Measuring Temporal Lags in Delay-Tolerant Networks.
IEEE Trans. Computers, 2014

Decontaminating a Network from a Black Virus.
IJNC, 2014

Robots with Lights: Overcoming Obstructed Visibility Without Colliding.
CoRR, 2014

Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem.
CoRR, 2014

Robots with Lights: Overcoming Obstructed Visibility Without Colliding.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Distributed Barrier Coverage with Relocatable Sensors.
Proceedings of the Structural Information and Communication Complexity, 2014

Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Sensor deployment by a robot in an unknown orthogonal region: Achieving full coverage.
Proceedings of the 20th IEEE International Conference on Parallel and Distributed Systems, 2014

Synchronized Dancing of Oblivious Chameleons.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

The Mutual Visibility Problem for Oblivious Robots.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
On the exploration of time-varying networks.
Theor. Comput. Sci., 2013

Exploring an unknown dangerous graph using tokens.
Theor. Comput. Sci., 2013

Rendezvous of Two Robots with Constant Memory.
CoRR, 2013

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.
Algorithmica, 2013

Mobility and Computations: Some Open Research Directions.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Rendezvous of Two Robots with Constant Memory.
Proceedings of the Structural Information and Communication Complexity, 2013

Network Decontamination from a Black Virus.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Expressivity of Time-Varying Graphs.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Optimal Network Decontamination with Threshold Immunity.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Distributed Computing by Oblivious Mobile Robots
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2012

Distributed Minimum Spanning Tree Maintenance for Transient Node Failures.
IEEE Trans. Computers, 2012

Distributed Computing by Mobile Robots: Gathering.
SIAM J. Comput., 2012

Time-varying graphs and dynamic networks.
IJPEDS, 2012

Searching for Black Holes in Subways.
Theory Comput. Syst., 2012

Connected graph searching.
Inf. Comput., 2012

A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast
CoRR, 2012

Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks
CoRR, 2012

Building Fastest Broadcast Trees in Periodically-Varying Graphs
CoRR, 2012

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles.
Algorithmica, 2012

Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles.
Proceedings of the Structural Information and Communication Complexity, 2012

Brief announcement: waiting in dynamic networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits.
Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

Finding Good Coffee in Paris.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Distributed Security Algorithms for Mobile Agents.
Proceedings of the Mobile Agents in Networking and Distributed Computing, 2012

2011
Computing by Mobile Robotic Sensors.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage.
IEEE Trans. Mob. Comput., 2011

A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree.
IEEE Trans. Dependable Sec. Comput., 2011

Efficient, Decentralized Computation of the Topology of Spatial Regions.
IEEE Trans. Computers, 2011

A Reference Model for Semantic Peer-to-Peer Networks.
J. Data Semantics, 2011

How many oblivious robots can explore a line.
Inf. Process. Lett., 2011

Uniform Scattering of Autonomous Mobile Robots in a Grid.
Int. J. Found. Comput. Sci., 2011

Time Optimal Algorithms for Black Hole Search in Rings.
Discrete Math., Alg. and Appl., 2011

Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics
CoRR, 2011

Computing in Time-Varying Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Improving the Optimal Bounds for Black Hole Search in Rings.
Proceedings of the Structural Information and Communication Complexity, 2011

Measuring Temporal Lags in Delay-Tolerant Networks.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

On the temporal analysis of scientific network evolution.
Proceedings of the International Conference on Computational Aspects of Social Networks, 2011

Neighbour Selection and Sensor Knowledge: Proactive Approach for the Frugal Feeding Problem in Wireless Sensor Networks.
Proceedings of the Ad Hoc Networks - Third International ICST Conference, 2011

Time-Varying Graphs and Dynamic Networks.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 10th International Conference, 2011

2010
Remembering without memory: Tree exploration by asynchronous oblivious robots.
Theor. Comput. Sci., 2010

From P2P to reliable semantic P2P systems.
Peer-to-Peer Networking and Applications, 2010

Time-Varying Graphs and Dynamic Networks
CoRR, 2010

Network Exploration by Silent and Oblivious Robots.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Pro-active Strategies for the Frugal Feeding Problem in Wireless Sensor Networks.
Proceedings of the Sensor Systems and Software - Second International ICST Conference, 2010

On the computational power of oblivious robots: forming a series of geometric patterns.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

On the Message Complexity of Global Computations.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Mobility-Based Strategies for Energy Restoration in Wireless Sensor Networks.
Proceedings of the Sixth International Conference on Mobile Ad-hoc and Sensor Networks, 2010

Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility.
Proceedings of the Theoretical Computer Science, 2010

Mapping an Unfriendly Subway System.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Time Optimal Algorithms for Black Hole Search in Rings.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks.
IEEE Trans. Computers, 2009

Fault-Tolerant Sequential Scan.
Theory Comput. Syst., 2009

Exploration of Periodically Varying Graphs
CoRR, 2009

Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Distributed Facility Location for Sensor Network Maintenance.
Proceedings of the MSN 2009, 2009

A Reference Model for Semantic Peer-to-Peer Networks.
Proceedings of the E-Technologies: Innovation in an Open World, 2009

Focused-Coverage by Mobile Sensor Networks.
Proceedings of the IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, 2009

Exploration of Periodically Varying Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Map construction and exploration by mobile agents scattered in a dangerous network.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Uniform scattering of autonomous mobile robots in a grid.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Localized Sensor Self-Deployment for Guaranteed Coverage Radius Maximization.
Proceedings of IEEE International Conference on Communications, 2009

2008
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots.
Theor. Comput. Sci., 2008

Self-deployment of mobile sensors on a ring.
Theor. Comput. Sci., 2008

On fractional dynamic faults with thresholds.
Theor. Comput. Sci., 2008

Localized sensor self-deployment with coverage guarantee.
Mobile Computing and Communications Review, 2008

Computing all the best swap edges distributively.
J. Parallel Distrib. Comput., 2008

Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens.
Int. J. Found. Comput. Sci., 2008

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Mobile Entities Computing: Models and Problems.
Proceedings of the Structural Information and Communication Complexity, 2008

Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots.
Proceedings of the Structural Information and Communication Complexity, 2008

Localized distance-sensitive service discovery in wireless sensor networks.
Proceedings of the 1st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, 2008

Tree Decontamination with Temporary Immunity.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007
Distributed Computing in the Presence of Mobile Faults.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Agreement in synchronous networks with ubiquitous faults.
Theor. Comput. Sci., 2007

Map construction of unknown graphs by multiple agents.
Theor. Comput. Sci., 2007

Rendezvous and Election of Mobile Agents: Impact of Sense of Direction.
Theory Comput. Syst., 2007

On the longest increasing subsequence of a circular list.
Inf. Process. Lett., 2007

Network decontamination in Presence of Local Immunity.
Int. J. Found. Comput. Sci., 2007

Mobile Search for a Black Hole in an Anonymous Ring.
Algorithmica, 2007

A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Mesh-Based Sensor Relocation for Coverage Maintenance in Mobile Sensor Networks.
Proceedings of the Ubiquitous Intelligence and Computing, 4th International Conference, 2007

Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2007

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Scattered Black Hole Search in an Oriented Ring using Tokens.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Distributed Computation of All Node Replacements of a Minimum Spanning Tree.
Proceedings of the Euro-Par 2007, 2007

Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents.
Proceedings of the Euro-Par 2007, 2007

Design and analysis of distributed algorithms.
Wiley series on parallel and distributed computing, Wiley, ISBN: 978-0-471-71997-7, 2007

2006
Black hole search in common interconnection networks.
Networks, 2006

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively.
IEICE Transactions, 2006

Searching for a black hole in arbitrary networks: optimal mobile agents protocols.
Distributed Computing, 2006

Groupings and Pairings in Anonymous Networks.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

On Fractional Dynamic Faults with Threshold.
Proceedings of the Structural Information and Communication Complexity, 2006

Order and Balance in Continuously-Fault-Tolerant Distributions of Objects.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2006

Issues for Robust Consensus Building in P2P Networks.
Proceedings of the On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops, 2006

An Integrated Self-deployment and Coverage Maintenance Scheme for Mobile Sensor Networks.
Proceedings of the Mobile Ad-hoc and Sensor Networks, Second International Conference, 2006

ZONER: A ZONE-based Sensor Relocation Protocol for Mobile Sensor Networks.
Proceedings of the LCN 2006, 2006

Effective Elections for Anonymous Mobile Agents.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Network decontamination with local immunization.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Distributed Algorithms for Autonomous Mobile Robots.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Distributed Algorithms for Autonomous Mobile Robots.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Exploring an Unknown Graph to Locate a Black Hole Using Tokens.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

Distributed Security Algorithms by Mobile Agents.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

Black Hole Search in Asynchronous Rings Using Tokens.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

Self-deployment Algorithms for Mobile Sensors on a Ring.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

Solving Distributed Mutual Exclusion using Cooperating Mobile Agents.
Proceedings of the 5th Annual IEEE/ACIS International Conference on Computer and Information Science (ICIS 2006) and 1st IEEE/ACIS International Workshop on Component-Based Software Engineering, 2006

2005
Gathering of asynchronous robots with limited visibility.
Theor. Comput. Sci., 2005

Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults.
Proceedings of the Structural Information and Communication Complexity, 2005

Distributed Exploration of an Unknown Graph.
Proceedings of the Structural Information and Communication Complexity, 2005

Mobile Agents Computing: Security Issues and Algorithmic Solutions.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004
Sorting and election in anonymous asynchronous rings.
J. Parallel Distrib. Comput., 2004

Fun with algorithms.
Discrete Applied Mathematics, 2004

Dynamic monopolies in tori.
Discrete Applied Mathematics, 2004

Mobile Agents Rendezvous When Tokens Fail.
Proceedings of the Structural Information and Communication Complexity, 2004

Improved Bounds for Optimal Black Hole Search with a Network Map.
Proceedings of the Structural Information and Communication Complexity, 2004

Computing All the Best Swap Edges Distributively.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

On the Performance of Distributed Search by Mobile Agents.
Proceedings of the Mobility Aware Technologies and Applications, 2004

Multiple Mobile Agent Rendezvous in a Ring.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Comparing Performance of Two Mobile Agent Platforms in Distributed Search.
Proceedings of the 2004 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2004), 2004

2003
Computing on anonymous networks with sense of direction.
Theor. Comput. Sci., 2003

Sense of direction in distributed computing.
Theor. Comput. Sci., 2003

Backward Consistency and Sense of Direction in Advanced Distributed Systems.
SIAM J. Comput., 2003

On time versus size for monotone dynamic monopolies in regular topologies.
J. Discrete Algorithms, 2003

Tight Bounds for Synchronous Communication of Information Using Bits, Silence.
Discrete Applied Mathematics, 2003

Searching Is Not Jumping.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Can we elect if we cannot compare?
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Multiple Agents RendezVous in a Ring in Spite of a Black Hole.
Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

Mobile Agent Rendezvous in a Ring.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

Solving the Robots Gathering Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
FUN with Algorithms - Foreword.
Theor. Comput. Sci., 2002

Capture of an intruder by mobile agents.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Searching for a black hole in arbitrary networks: optimal mobile agent protocols.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Black Hole Search by Mobile Agents in Hypercubes and Related Networks.
Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

2001
Distributed computing on oriented anonymous hypercubes with faulty components.
Distributed Computing, 2001

Optimal irreversible dynamos in chordal rings.
Discrete Applied Mathematics, 2001

Mobile Search for a Black Hole in an Anonymous Ring.
Proceedings of the Distributed Computing, 15th International Conference, 2001

Gathering of Asynchronous Oblivious Robots with Limited Visibility.
Proceedings of the STACS 2001, 2001

Distributed Computations by Autonomous Mobile Robots.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

On Finding Minimum Deadly Sets for Directed Networks.
Proceedings of the SIROCCO 8, 2001

Pattern Formation by Anonymous Robots Without Chirality.
Proceedings of the SIROCCO 8, 2001

A Mobile Agent Prototype for Distributed Search.
Proceedings of the Mobile Agents for Telecommunication Applications, 2001

2000
An improved testing scheme for catastrophic fault patterns.
Inf. Process. Lett., 2000

On time versus size for monotone dynamic monopolies in regular topologies.
Proceedings of the SIROCCO 7, 2000

Asynchronous to Synchronous transformations.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

Sorting Multisets in Anonymous Rings.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Optimal Irreversible Dynamos in Chordal Rings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Introduction: Distributed Data & Structures 2.
Proceedings of the Distributed Data & Structures 2, 1999

Monotone Dynamos in Tori.
Proceedings of the SIROCCO'99, 1999

Backward Consistency and Sense of Direction in Advanced Distributed Systems.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Biconsistency and Homonymy in Distributed Systems with Edge Symmetry.
Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998
Optimal Elections in Faulty Loop Networks and Applications.
IEEE Trans. Computers, 1998

Sense of direction: Definitions, properties, and classes.
Networks, 1998

Efficient Token-Based Control in Rings.
Inf. Process. Lett., 1998

Topological Constraints for Sense of Direction.
Int. J. Found. Comput. Sci., 1998

Symmetries and Sense of Direction in Labeled Graphs.
Discrete Applied Mathematics, 1998

Introduction: Distributed Data and Structures 1.
Proceedings of the Distributed Data & Structures, 1998

Sense of Direction in Distributed Computing.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

Irreversible Dynamos in Tori.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
Efficient Distributed Selection with Bounded Messages.
IEEE Trans. Parallel Distrib. Syst., 1997

CA-Like Error Propagation in Fuzzy CA.
Parallel Computing, 1997

Time-Message Trade-Offs for the Weak Unison Problem.
Nord. J. Comput., 1997

On the Impact of Sense of Direction on Message Complexity.
Inf. Process. Lett., 1997

Improved Bounds for Electing a Leader in a Synchronous Ring.
Algorithmica, 1997

Levels of Sense of Direction in Distributed Systems.
Proceedings of the On Principles Of Distributed Systems, 1997

Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Finding the Extrema of a Distributed Multiset.
J. Parallel Distrib. Comput., 1996

On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy.
Integration, 1996

Efficient Token-Based Control in Rings (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Ring reconfiguration in presence of close fault cuts.
Proceedings of the 1996 International Symposium on Parallel Architectures, 1996

1995
On Reliability Analysis of Chordal Rings.
Journal of Circuits, Systems, and Computers, 1995

Topological Constraints for Sense of Direction.
Proceedings of the Structure, Information and Communication Complexity, 1995

Translation Capabilities of Sense of Direction.
Proceedings of the Structure, Information and Communication Complexity, 1995

On the Complexity of Testing for Catastrophic Faults.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Efficient reconfiguration technique for redundant ring networks.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994
Trade-Offs in Non-Reversing Diameter.
Nord. J. Comput., 1994

Guarding rectangular art galleries.
Discrete Applied Mathematics, 1994

Finding the Extrema of a Distributed Multiset.
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

Sense of Direction: Formal Definitions and Properties.
Proceedings of the Structural Information and Communication Complexity, 1994

Preface.
Proceedings of the Structural Information and Communication Complexity, 1994

On the Impact of Sense of Direction in Arbitrary Networks.
Proceedings of the 14th International Conference on Distributed Computing Systems, 1994

Optimal Fault-Tolerant Leader Election in Chordal Rings.
Proceedings of the Digest of Papers: FTCS/24, 1994

Time-Message Trade-Offs for the Weak Unison Problem.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993
Efficient construction of catastrophic patterns for VLSI reconfigurable arrays.
Integration, 1993

1992
A Distributed Selection Algorithm and its Expected Communication Complexity.
Theor. Comput. Sci., 1992

The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links.
Proceedings of the Computing and Information, 1992

1991
Computational Geometry Algorithms for the Systolic Screen.
Algorithmica, 1991

Tight Bounds for the Rectangualr Art Gallery Problem.
Proceedings of the 17th International Workshop, 1991

Bounds on Performance of VLSI Processor Arrays.
Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

1990
Sums of lexicographically ordered sets.
Discrete Mathematics, 1990

Distributed Function Evaluation in the Presence of Transmission Faults.
Proceedings of the Algorithms, 1990

Fault-intolerance of reconfigurable systolic arrays.
Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

1989
Reduction Techniques for Selection in Distributed Files.
IEEE Trans. Computers, 1989

Geometric Containment and Partial Orders.
SIAM J. Discrete Math., 1989

Efficient Elections in Chordal Ring Networks.
Algorithmica, 1989

Time is Not a Healer.
Proceedings of the STACS 89, 1989

TIME vs BITS.
Proceedings of the STACS 89, 1989

1988
On the Expected Complexity of Distributed Selection.
J. Parallel Distrib. Comput., 1988

A Practical Algorithm for Boolean Matrix Multiplication.
Inf. Process. Lett., 1988

(Time × Space)-Efficient Implementations of Hierarchical Conceptual Models.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

Geometric Containment, Common Roots of Polynomials and Partial Orders.
Proceedings of the STACS 88, 1988

1987
Geometric Containment and Vector Dominance.
Theor. Comput. Sci., 1987

Optimal Parallel Merging and Sorting Without Memory Conflicts.
IEEE Trans. Computers, 1987

Analysis of a Distributed Algorithm for Extrema Finding in a Ring.
J. Parallel Distrib. Comput., 1987

On the Packet Complexity of Distributed Selection.
Proceedings of the Distributed Algorithms, 1987

On the Expected Complexity of Distributed Selection.
Proceedings of the STACS 87, 1987

Computing on a Systolic Screen: Hulls, Contours and Applications.
Proceedings of the PARLE, 1987

Optimal VLSI Dictionary Machines on Meshes.
Proceedings of the International Conference on Parallel Processing, 1987

Improving Semi-Join Evaluation in Distributed Query Processing.
Proceedings of the 7th International Conference on Distributed Computing Systems, 1987

Guessing Games and Distributed Computations in Synchronous Networks.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters.
IEEE Trans. Communications, 1986

Shout echo selection in distributed files.
Networks, 1986

Uniquely colourable m-dichromatic oriented graphs.
Discrete Mathematics, 1986

An improved algorithm for Boolean matrix multiplication.
Computing, 1986

Min-Max Heaps and Generalized Priority Queues.
Commun. ACM, 1986

Reduction Techniques for Selection in Distributed Files.
Proceedings of the International Conference on Parallel Processing, 1986

Breaking Symmetry in Synchronous Networks.
Proceedings of the VLSI Algorithms and Architectures, 1986

1985
Distributed Sorting.
IEEE Trans. Computers, 1985

Interpolation-Binary Search.
Inf. Process. Lett., 1985

Labelling and Implicit Routing in Networks.
Comput. J., 1985

Geometric Containment is not Reducible to Pareto Dominance.
Proceedings of the STACS 85, 1985

1984
Distributed Algorithms for Finding Centers and Medians in Networks.
ACM Trans. Program. Lang. Syst., 1984

On the message complexity of distributed problems.
International Journal of Parallel Programming, 1984

Chain Multiplication of Matrices of Approximately or Exactly the Same Size.
Commun. ACM, 1984

1980
Extending the Four Russians' Bound to General Matrix Multiplication.
Inf. Process. Lett., 1980

1979
Distributed Control of Updates in Multiple-Copy Databases: A Time Optimal Algorithm.
Proceedings of the Fourth Berkeley Workshop on Distributed Data Management and Computer Networks, 1979

1976
Random access in a list environment.
Inf. Syst., 1976

Full Table Search by Polynomial Functions.
Inf. Process. Lett., 1976


  Loading...