3 citations · 4 across the 7 of their papers we have counts for
6 papers · 1 filter
No Distributed Quantum Advantage for 3-Coloring Rooted Trees and 2-Coloring Even Cycles
Pierre Fraigniaud, Frédéric Magniez, Isabella Ziccardi
Significant effort has been devoted over the past decade to understanding whether quantum resources can provide advantages in distributed computing, and in particular whether they…
Threshold-Driven Streaming Graph: Expansion and Rumor Spreading
Flora Angileri, Andrea Clementi, Emanuele Natale +2
A randomized distributed algorithm called RAES was introduced in [Becchetti et al., SODA 2020] to extract a bounded-degree expander from a dense -vertex expander graph $G = (V,…
The Minority Dynamics and the Power of Synchronicity
Luca Becchetti, Andrea Clementi, Francesco Pasquale +3
We study the minority-opinion dynamics over a fully-connected network of nodes with binary opinions. Upon activation, a node receives a sample of opinions from a limited number…
Distributed Self-Stabilizing MIS with Few States and Weak Communication
George Giakkoupis, Isabella Ziccardi
We study a simple random process that computes a maximal independent set (MIS) on a general -vertex graph. Each vertex has a binary state, black or white, where black indicates…
Expansion and Flooding in Dynamic Random Networks with Node Churn
Luca Becchetti, Andrea Clementi, Francesco Pasquale +2
We study expansion and information diffusion in dynamic networks, that is in networks in which nodes and edges are continuously created and destroyed. We consider information diffu…
Parallel Load Balancing on Constrained Client-Server Topologies
Andrea Clementi, Emanuele Natale, Isabella Ziccardi
We study parallel \emph{Load Balancing} protocols for a client-server distributed model defined as follows. There is a set $\sC$ of clients and a set $\sS$ of servers where…