59 citations · 213 across the 21 of their papers we have counts for
4 papers · 1 filter
The Input/Output Complexity of Triangle Enumeration
Rasmus Pagh, Francesco Silvestri
We consider the well-known problem of enumerating all triangles of an undirected graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let be th…
Communication Lower Bounds for Distributed-Memory Computations
Michele Scquizzato, Francesco Silvestri
We give lower bounds on the communication complexity required to solve several computational problems in a distributed-memory parallel machine, namely standard matrix multiplicatio…
Space-Efficient Parallel Algorithms for Combinatorial Search Problems
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri +1
We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an -…
Exploiting non-constant safe memory in resilient algorithms and data structures
Lorenzo De Stefani, Francesco Silvestri
We extend the Faulty RAM model by Finocchi and Italiano (2008) by adding a safe memory of arbitrary size , and we then derive tradeoffs between the performance of resilient algo…