3 citations · 4 across the 6 of their papers we have counts for
9 papers
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…
Bond Percolation in Small-World Graphs with Power-Law Distribution
Luca Becchetti, Andrea Clementi, Francesco Pasquale +2
\emph{Full-bond percolation} with parameter is the process in which, given a graph, for every edge independently, we delete the edge with probability . Bond percolation is…
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
Luciano Gualà, Stefano Leucci, Isabella Ziccardi
We study the problem of designing a \emph{resilient} data structure maintaining a tree under the Faulty-RAM model [Finocchi and Italiano, STOC'04] in which up to memory words c…