Francesco Silvestri
Title
Cited by
Cited by
Year
Oblivious algorithms for multicores and network of processors
RA Chowdhury, F Silvestri, B Blakeley, V Ramachandran
IEEE International Parallel & Distributed Processing Symposium, 2010
882010
Oblivious algorithms for multicores and networks of processors
RA Chowdhury, V Ramachandran, F Silvestri, B Blakeley
Journal of Parallel and Distributed Computing 73 (7), 911-925, 2013
872013
MapReduce Triangle Enumeration With Guarantees
HM Park, F Silvestri, U Kang, R Pagh
23rd ACM International Conference on Information and Knowledge Management …, 2014
672014
Space-Round Tradeoffs for MapReduce Computations
A Pietracaprina, G Pucci, M Riondato, F Silvestri, E Upfal
26th ACM international conference on Supercomputing, 235-244, 2012
652012
The Input/Output Complexity of Triangle Enumeration
R Pagh, F Silvestri
33rd ACM Symposium on Principles of Database Systems, 224-233, 2014
592014
On the Complexity of Inner Product Similarity Join
TD Ahle, R Pagh, I Razenshteyn, F Silvestri
Proc. 35th ACM Symposium on Principles of Database Systems, 2016
322016
Software-Based Hardening Strategies for Neutron Sensitive FFT Algorithms on GPUs
LL Pilla, P Rech, F Silvestri, C Frost, POA Navaux, MS Reorda, L Carro
IEEE Transactions on Nuclear Science 61 (4), 1874 - 1880, 2014
302014
Communication Lower Bounds for Distributed-Memory Computations
M Scquizzato, F Silvestri
31st Symposium on Theoretical Aspects of Computer Science, 627-638, 2014
232014
Locality-sensitive hashing of curves
A Driemel, F Silvestri
arXiv preprint arXiv:1703.04040, 2017
222017
I/O-efficient similarity join
R Pagh, N Pham, F Silvestri, M Stöckel
Proc. of 23rd Annual European Symposium on Algorithms 9294, 941-952, 2015
212015
Network-Oblivious Algorithms
G Bilardi, A Pietracaprina, G Pucci, M Scquizzato, F Silvestri
Journal of the ACM 63 (1), 2016
202016
Approximate furthest neighbor in high dimensions
R Pagh, F Silvestri, J Sivertsen, M Skala
Proc. 8th Int. Conference on Similarity Search and Applications (SISAP), 3-14, 2015
202015
Network-oblivious algorithms
G Bilardi, A Pietracaprina, G Pucci, F Silvestri
IEEE 21st International Parallel and Distributed Processing Symposium, 1-10, 2007
20*2007
A Lower Bound Technique for Communication on BSP with Application to the FFT
G Bilardi, M Scquizzato, F Silvestri
18th International Conference Euro-Par, pages 676-687, 2012
172012
Distance sensitive bloom filters without false negatives
M Goswami, R Pagh, F Silvestri, J Sivertsen
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
112017
Distance-sensitive hashing
M Aumüller, T Christiani, R Pagh, F Silvestri
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018
102018
On the limits of cache-oblivious matrix transposition
F Silvestri
International Symposium on Trustworthy Global Computing, 233-243, 2006
92006
Experimental evaluation of multi-round matrix multiplication on MapReduce
M Ceccarello, F Silvestri
17th SIAM Meeting on Algorithm Engineering & Experiments (ALENEX), 2015
82015
Dynamic programming in faulty memory hierarchies (cache-obliviously)
S Caminiti, I Finocchi, EG Fusco, F Silvestri
IARCS Annual Conference on Foundations of Software Technology and …, 2011
82011
Approximate furthest neighbor with application to annulus query
R Pagh, F Silvestri, J Sivertsen, M Skala
Information Systems 64, 152-162, 2017
72017
The system can't perform the operation now. Try again later.
Articles 1–20