Publications

The copyrights for journal and conference proceedings papers generally belong to the publisher. The papers may be downloaded for personal or research purposes only.

Publications listed by type


Journal papers

  1. I/O-Efficient Similarity Join
    Rasmus Pagh, Ninh Pham, Francesco Silvestri and Morten Stöckel. In Algorithmica, 78, 4, 1263–1283, 2017.

  2. Approximate furthest neighbor with application to annulus query
    Rasmus Pagh, Francesco Silvestri, Johan Sivertsen and Matthew Skala. In Information Systems, 64, 152 - 162, 2017.

  3. Resilient Dynamic Programming
    Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco and Francesco Silvestri. In Algorithmica, 77, 389–425, 2017.

  4. Network-Oblivious Algorithms
    Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato and Francesco Silvestri. In Journal of the ACM, 63, 1, 3:1–3:36, 2016.

  5. Exploiting non-constant safe memory in resilient algorithms and data structures
    Lorenzo De Stefani and Francesco Silvestri. In Theoretical Computer Science, 583, 86 - 97, 2015.

  6. Space-efficient parallel algorithms for combinatorial search problems
    Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri and Fabio Vandin. In Journal of Parallel and Distributed Computing, 76, 58 - 65, 2015. Special issue on architecture and algorithms for irregular applications.

  7. Software-Based Hardening Strategies for Neutron Sensitive FFT Algorithms on GPUs
    Laércio L. Pilla, Paolo Rech, Francesco Silvestri, Christopher Frost, Philippe Navaux, Matteo S. Reorda and Luigi Carro. In IEEE Transactions on Nuclear Science, 61, 4, 1874-1880, 2014.

  8. Oblivious algorithms for multicores and networks of processors
    Rezaul Alam Chowdhury, Vijaya Ramachandran, Francesco Silvestri and Brandon Blakeley. In Journal of Parallel and Distributed Computing, 73, 7, 911 - 925, 2013. Special issue dedicated to the best papers of IPDPS 2010, 2011 and 2012.

  9. Review of Graph Theory and Interconnection Networks, by Lih-Hsing Hsu and Cheng-Kuan Lin
    Francesco Silvestri. In SIGACT News, 43, 4, 30–34, 2012.

  10. An optimized data structure for high-throughput 3D proteomics data: mzRTree
    Sara Nasso, Francesco Silvestri, Francesco Tisiot, Barbara Di Camillo, Andrea Pietracaprina and Gianna Maria Toffolo. In Journal of Proteomics, 73, 6, 1176 - 1182, 2010.

  11. On the limits of cache-oblivious rational permutations
    Francesco Silvestri. In Theoretical Computer Science, 402, 2, 221 - 233, 2008.

Conference papers

  1. Locality-Sensitive Hashing of Curves
    Anne Driemel and Francesco Silvestri. In Proc. 33rd International Symposium on Computational Geometry (SoCG), 77 : 37:1–37:16, LIPIcs, 2017.

  2. A Time-Space Trade-Off for Triangulations of Points in the Plane
    Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh and Francesco Silvestri. In Proc. 23rd International Computing and Combinatorics Conference (COCOON), 10392 : 3–12, LNCS, 2017.

  3. Distance Sensitive Bloom Filters Without False Negatives
    Mayank Goswami, Rasmus Pagh, Francesco Silvestri and Johan Sivertsen. In Proc. 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), 257-269, 2017. (Acceptance rate 34%.)

  4. On the Complexity of Inner Product Similarity Join
    Thomas Dybdahl Ahle, Rasmus Pagh, Ilya Razenshteyn and Francesco Silvestri. In Proc. 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS), 151–164, 2016. (Acceptance rate 33%.)

  5. Approximate Furthest Neighbor in High Dimensions
    Rasmus Pagh, Francesco Silvestri, Johan Sivertsen and Matthew Skala. In Proc. 8th International Conference on Similarity Search and Applications (SISAP), 3–14, 2015. (Acceptance rate 29%.)

  6. I/O-Efficient Similarity Join
    Rasmus Pagh, Ninh Pham, Francesco Silvestri and Morten Stöckel. In Proc. 23rd Annual European Symposium on Algorithms, 941–952, 2015. (Acceptance rate 26%.)

  7. Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce
    Matteo Ceccarello and Francesco Silvestri. In Proc. 17th Workshop on Algorithm Engineering and Experiments (ALENEX), 119-132, 2015. (Acceptance rate 28%.)

  8. MapReduce Triangle Enumeration With Guarantees
    Ha-Myung Park, Francesco Silvestri, U Kang and Rasmus Pagh. In Proc. 23rd ACM International Conference on Conference on Information and Knowledge Management (CIKM), 1739–1748, 2014. (Acceptance rate 21%.)

  9. Subgraph Enumeration in Massive Graphs
    Francesco Silvestri. In Proc. 6th Workshop on Massive Data Algorithmics (MASSIVE), 2014.

  10. The Input/Output Complexity of Triangle Enumeration
    Rasmus Pagh and Francesco Silvestri. In Proc. 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), 224–233, 2014. (Acceptance rate 33%.)

  11. Communication Lower Bounds for Distributed-Memory Computations
    Michele Scquizzato and Francesco Silvestri. In Proc. 31st International Symposium on Theoretical Aspects of Computer Science (STACS), 25 : 627–638, LIPIcs, 2014. Preliminary version presented at 5th Workshop on Massive Data Algorithmics (MASSIVE) 2013. (Acceptance rate 25.7%)

  12. Space-Efficient Parallel Algorithms for Combinatorial Search Problems
    Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri and Fabio Vandin. In Proc. 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), 8087 : 717–728, LNCS, 2013.

  13. Neutron Sensitivity and Software Hardening Strategies for Matrix Multiplication and FFT on Graphics Processing Units
    Paolo Rech, Laercio Pilla, Francesco Silvestri, Philippe Navaux and Luigi Carro. In Proc. 3rd Workshop on Fault-tolerance for HPC at Extreme Scale (FTXS), 13–20, 2013.

  14. Neutron sensitivity and hardening strategies for Fast Fourier Transform on GPUs
    Paolo Rech, Laercio Pilla, Francesco Silvestri, Christopher Frost, Philippe Navaux, Matteo S. Reorda and Luigi Carro. In Proc. 14th European Conference on Radiation and Its Effects on Components and Systems (RADECS), 1-5, 2013.

  15. A Lower Bound Technique for Communication on BSP with Application to the FFT
    Gianfranco Bilardi, Michele Scquizzato and Francesco Silvestri. In Proc. 18th European Conference on Parallel Processing (Euro-Par), 7484 : 676–687, LNCS, 2012.

  16. Space-round tradeoffs for MapReduce computations
    Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri and Eli Upfal. In Proc. 26th ACM international conference on Supercomputing, 235–244, 2012.

  17. Dynamic programming in faulty memory hierarchies (cache-obliviously)
    Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco and Francesco Silvestri. In Proc. 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 13 : 433–444, LIPIcs, 2011. Preliminarly presented at the Third Workshop on Massive Data Algorithmics (MASSIVE), 2011.

  18. Oblivious algorithms for multicores and network of processors
    Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley and Vijaya Ramachandran. In Proc. IEEE 24th International Parallel and Distributed Processing Symposium (IPDPS), 1-12, 2010. Best Paper Award in the Algorithms Track.

  19. A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments
    Paolo Bertasi, Alberto Pettarin, Michele Scquizzato and Francesco Silvestri. In Proc. 5th International Symposium of Trustworthly Global Computing (TGC), 6084 : 268–283, LNCS, 2010.

  20. Network-Oblivious Algorithms
    Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci and Francesco Silvestri. In Proc. of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1-10, 2007.

  21. Cache-oblivious simulation of parallel programs
    Andrea Pietracaprina, Geppino Pucci and Francesco Silvestri. In Proc. of the 8th IEEE IPDPS Workshop on Advances in Parallel and Distributed Computational Models (APDCM), 2006.

Unpublished papers

  1. Distance-sensitive hashing
    Martin Aumüller, Tobias Christiani, Rasmus Pagh and Francesco Silvestri. Submitted 2017.

  2. A Lower Bound Technique for Communication on BSP with Application to the FFT
    Gianfranco Bilardi, Michele Scquizzato and Francesco Silvestri. Submitted 2017. (Journal version.)

  3. CTTP: Enumerating Triangles With Guarantees
    Ha-Myung Park, Francesco Silvestri, Rasmus Pagh, Chin-Wan Chung, Sung-Hyon Myaeng and U Kang. Submitted 2017. (Journal version.)

Other documents

  1. Mapreduce method for triangle enumeration and apparatus thereof
    U Kang, Park, Ha-Myung, Rasmus Pagh and Francesco Silvestri. 2016. Patent 10-2015-0020455, South Korea.

  2. Oblivious Computations on Memory and Network Hierarchies
    Francesco Silvestri. University of Padova 2009. Supervisor A. Pietracaprina.

  3. An Oblivious Approach to Parallel Algorithms
    Francesco Silvestri. 2008. Poster for the 2008 IPDPS TCPP PhD Forum

  4. Network-Oblivious Algorithms
    Francesco Silvestri. 2007. Poster for the Summer School on Algorithmic Data Analysis (SADA) and Annual Hecse Poster Session. Poster Abstracts, Series of Publications B, Report B-2007-4, page 72. Helsinki University Printing House.

  5. Simulazione di algoritmi paralleli per il modello D-BSP su una gerarchia di cache ideali
    Francesco Silvestri. University of Padova 2005. "Laurea quinquennale" Thesis in Computer Science Engineering. Supervisors A. Pietracaprina and G. Pucci. In Italian.