59 citations · 213 across the 21 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DC2014★ 2 cited
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce
Matteo Ceccarello, Francesco Silvestri
A common approach in the design of MapReduce algorithms is to minimize the number of rounds. Indeed, there are many examples in the literature of monolithic MapReduce algorithms, w…
cs.DS2014★ 3 cited
Network-Oblivious Algorithms
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci +2
A framework is proposed for the design and analysis of \emph{network-oblivious algorithms}, namely, algorithms that can run unchanged, yet efficiently, on a variety of machines cha…
cs.DS2014★ 3 cited
Subgraph Enumeration in Massive Graphs
Francesco Silvestri
We consider the problem of enumerating all instances of a given pattern graph in a large data graph. Our focus is on determining the input/output (I/O) complexity of this problem.…