39 citations · 89 across the 21 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 8 cited
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…
cs.DS2013★ 5 cited
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 -…