• Publications
  • Influence
Conflict Managers for Self-stabilization without Fairness Assumption
It is argued that conflict managers are a useful mechanism to transform a large class of self-stabilizing algorithms that operate in an essentially sequential model, into self-Stabilizing algorithm that operation in a completely asynchronous distributed model.
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
A self-stabilizing probabilistic solution for the neighborhood unique naming problem in uniform, anonymous networks with arbitrary topology is proposed and it is proved that this solution needs in average only one trial per processor.
Stabilizing leader election in population protocols
This work extends the study of population protocols to trees and arbitrary topologies and proposes deterministic and probabilistic solutions that prove the necessity of the eventual leader detector even in environments helped by randomization.
Memory space requirements for self-stabilizing leader election protocols
It is proved that a non-constant lower bound on the memory space is required by a SSLE protocol on unidirectional, anonymous rings (even if the protocol is randomized), and it is shown that, if there is a deterministic protocol solving a problem on id-based systems where the processorMemory space is constant and the id-values are not bounded then there isA deterministic Protocol on anonymous systems using constant memory space that solves the same problem.
A Semantic Overlay for Self- Peer-to-Peer Publish/Subscribe
Publish/Subscribe systems provide a useful platform for delivering data (events) from publishers to subscribers in an anonymous fashion in distributed networks. In this paper, we promote a novel
Anonymous publish/subscribe in P2P networks
This paper uses the publish/subscribe communication paradigm to design deterministic protocols (topic and content-based) for peer-to-peer networks, and can cope with the anonymity and mobility of both publishers and subscribers, weak-connectivity, and polarization, which are some of the characteristics of peer- to- peer networks.
Stabilizing Flocking Via Leader Election in Robot Networks
This paper proposes and proves correct an architecture for a selforganizing and stabilizing flocking system and proposes novel probabilistic solutions for leader election in asynchronous settings under bounded schedulers and proposes a deterministic flocking algorithm totally independent of the existence of an a priori known leader.
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
A bounded-memory self-stabilizing local mutual exclusion algorithm for arbitrary network, assuming any arbitrary daemon, and two scheduler transformers which convert the algorithms working under a weaker daemon to ones which work under the distributed, arbitrary (or unfair) daemon, both transformers preserving the self-Stabilizing property.
Practically stabilizing SWMR atomic memory in message-passing systems
A fault-tolerant and practically stabilizing simulation of an atomic register is presented. The simulation works in asynchronous message-passing systems, and allows a minority of processes to crash.
Blockchain Abstract Data Type
This paper is the first to specify blockchains as a composition of abstract data types all together with a hierarchy of consistency criteria that formally characterizes the histories admissible for distributed programs that use them.