Related papers: Self-Stabilizing Pulse Synchronization Inspired by…
The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing…
Renaming is a fundamental problem in distributed computing, which consists of a set of processes picking distinct names from a given namespace. The paper presents algorithms that solve order-preserving renaming in synchronous message…
Driven by increased applications in biological networks and wireless sensor networks, synchronization of pulse-coupled oscillators (PCOs) has gained increased popularity. However, most existing results address the local synchronization of…
This paper explores the problem good-case latency of Byzantine fault-tolerant broadcast, motivated by the real-world latency and performance of practical state machine replication protocols. The good-case latency measures the time it takes…
Self-stabilization is a versatile fault-tolerance approach that characterizes the ability of a system to eventually resume a correct behavior after any finite number of transient faults. In this paper, we propose a self-stabilizing reset…
Common experience suggests that attracting invariant sets in nonlinear dynamical systems are generally stable. Contrary to this intuition, we present a dynamical system, a network of pulse-coupled oscillators, in which \textit{unstable…
The emergence of synchronization in a network of coupled oscillators is a pervasive topic in various scientific disciplines ranging from biology, physics, and chemistry to social networks and engineering applications. A coupled oscillator…
Dynamical systems driven by Gaussian noises have been considered extensively in modeling, simulation and theory. However, complex systems in engineering and science are often subject to non-Gaussian fluctuations or uncertainties. A coupled…
Detection and mitigation of Byzantine behaviors in a decentralized learning setting is a daunting task, especially when the data distribution at the users is heterogeneous. As our main contribution, we propose Basil, a fast and…
This paper focuses on decentralized stochastic optimization in the presence of Byzantine attacks. During the optimization process, an unknown number of malfunctioning or malicious workers, termed as Byzantine workers, disobey the…
Dualization is a key discrete enumeration problem. It is not known whether or not this problem is polynomial-time solvable. Asymptotically optimal dualization algorithms are the fastest among the known dualization algorithms, which is…
This thesis deals with the study of image processing algorithms which can be implemented by pulse-coupled neural nets. The inspiration for this choice is taken from biological image processing, which achieves with little computational…
The proliferation of wireless communications networks over the past decades, combined with the scarcity of the wireless spectrum, have motivated a significant effort towards increasing the throughput of wireless networks. One of the major…
This work considers resilient, cooperative state estimation in unreliable multi-agent networks. A network of agents aims to collaboratively estimate the value of an unknown vector parameter, while an {\em unknown} subset of agents suffer…
Consensus, abstracting a myriad of problems in which processes have to agree on a single value, is one of the most celebrated problems of fault-tolerant distributed computing. Consensus applications include fundamental services for the…
Improving the efficiency of current neural networks and modeling them in biological neural systems have become popular research directions in recent years. Pulse-coupled neural network (PCNN) is a well applicated model for imitating the…
We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network in which the agents communicate with their neighbors and perform local computation. In the proposed algorithm, each agent can…
Byzantine robustness has received significant attention recently given its importance for distributed and federated learning. In spite of this, we identify severe flaws in existing algorithms even when the data across the participants is…
Synchronization resulting in unified collective behavior of the individual elements of a system that are weakly coupled to each other has long fascinated scientists. Examples range from the periodic oscillation of coupled pendulum clocks to…
Partitioning large networks into stable clusters of synchronized nodes is a challenging task. Recent approaches based on spectral analysis can provide exact results on specific dynamics but remain unfeasible for very large networks.…