3 citations · 4 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
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…
math.PR2021
Percolation and Epidemic Processes in One-Dimensional Small-World Networks
Luca Becchetti, Andrea Clementi, Riccardo Denni +3
We obtain tight thresholds for bond percolation on one-dimensional small-world graphs, and apply such results to obtain tight thresholds for the \emph{Independent Cascade} process…