Journal papers

  1. R. Pagh, N. Pham, M. Stöckel, and F. Silvestri. I/O-Efficient Similarity Join. To appear in Algorithmica, special issue on ESA 2015, 2017.
    Pre-print on Arxiv, doi:10.1007/s00453-017-0285-5
  2. R. Pagh, F. Silvestri, J. Sivertsen, and M.Skala. Approximate furthest neighbor with application to annulus query. Information Systems, special issue on SISAP'15, volume 64, pages 152-162, 2017.
    software, pdf (pre-print), doi:10.1016/j.is.2016.07.006.
  3. G. Bilardi, A. Pietracaprina, G. Pucci, M. Scquizzato and F. Silvestri. Network-Oblivious Algorithms. Journal of the ACM, volume 63(1), article 3, March 2016.
    pdf, Pre-print on Arxiv, doi:10.1145/2812804.
  4. S. Caminiti, I. Finocchi, E.G. Fusco, and F. Silvestri. Resilient dynamic programming. Algorithmica, volume 77, issue 2, pages 389–425, 2017.
    pdf (pre-print), doi:10.1007/s00453-015-0073-z.
  5. L. De Stefani and F. Silvestri. Exploiting non-constant safe memory in resilient algorithms and data structures. Theoretical Computer Science, volume 583, pages 86-97, June 2015.
    Pre-print on Arxiv, doi:10.1016/j.tcs.2015.04.003.
  6. A. Pietracaprina, G. Pucci, F. Silvestri and F. Vandin. Space-Efficient Parallel Algorithms for Combinatorial Search Problems. Journal of Parallel and Distributed Computing, special issue on irregular computations, volume 76, pages 58-65, February 2015.
    Pre-print on Arxiv, doi:10.1016/j.jpdc.2014.09.007
  7. L. L. Pilla, P. Rech, F. Silvestri, C. Frost, P. O. A. Navaux, M. Sonza Reorda, and L. Carro. Software-Based Hardening Strategies for Neutron Sensitive FFT Algorithms on GPUs. IEEE Transactions on Nuclear Science, volume 61, issue 4, pages 1874-1880, August 2014.
    pdf (pre-print), doi:10.1109/TNS.2014.2301768.
  8. R. A. Chowdhury, V. Ramachandran, F. Silvestri, and B. Blakeley. Oblivious Algorithms for Multicores and Networks of Processors. Journal of Parallel and Distributed Computing, special issue dedicated to selected IPDPS'10 papers, volume 73, issue 7, pages 911-925, July 2013.
    pdf (pre-print), doi:10.1016/j.jpdc.2013.04.008.
  9. S. Nasso, F. Silvestri, F. Tisiot, B. Di Camillo, A. Pietracaprina, G. M. Toffolo. An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree, Journal of Proteomics, Volume 73, Issue 6, Pages 1043-1282, April 2010.
    software, pdf (pre-print), arXiv, BIBTEX entry, doi:10.1016/j.jprot.2010.02.006.
  10. F. Silvestri, On the Limits of Cache-Oblivious Rational Permutations, Special Issue of Theoretical Computer Science for selected TGC'06 papers, Volume 402, Issues 2-3, Pages 221-233, August 2008.
    pdf (pre-print), BIBTEX entry, doi:10.1016/j.tcs.2008.04.036

Conference/Workshop papers

  1. H.K. Ahn, N. Baraldo, E. Oh, F. Silvestri. A Time-Space Tradeoff for Triangulations of Points in the Plane. To appear in Proc. 23rd Annual International Computing and Combinatorics Conference (COCOON), 2017.
  2. A. Driemel and F. Silvestri. Locality-sensitive hashing of curves. To appear in Proc. 33rd Intl. Symposium on Computational Geometry (SoCG), 2017.
  3. M. Goswami, R. Pagh, F. Silvestri and J. Sivertsen. Distance Sensitive Bloom Filters Without False Negatives. Proc. 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 257-269. 2017. (Acceptance rate 34%.)
    Pre-print on Arxiv. doi:10.1137/1.9781611974782.17.
  4. T. D. Ahle, R. Pagh, I. Razenshteyn, F. Silvestri. On the Complexity of Inner Product Similarity Join. Proc. 35th ACM Symposium on Principles of Database Systems (PODS), pages 151-164 San Francisco (CA), USA, 2016. (Acceptance rate 33%.)
    Pre-print on Arxiv, doi:10.1145/2902251.2902285.
  5. R. Pagh, F. Silvestri, J. Sivertsen, M. Skala. Approximate Furthest Neighbor in High Dimensions. Proc. 8th Int. Conference on Similarity Search and Applications (SISAP), LNCS 9371, pages 3-14, Glasgow, UK, 2015. (Acceptance rate 29%.)
    pdf, doi:10.1007/978-3-319-25087-8_1.
  6. R. Pagh, N. Pham, M. Stöckel, and F. Silvestri. I/O-efficient Similarity Join. Proc. of 23rd Annual European Symposium on Algorithms (ESA), LNCS 9294, pages 941-952, Patras, Greece, 2015. (Acceptance rate 26%.)
    Pre-print on Arxiv, doi:10.1007/978-3-662-48350-3_78.
  7. M. Ceccarello and F. Silvestri. Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce, Proc. of 17th SIAM Meeting on Algorithm Engineering & Experiments (ALENEX), pages 119-132, San Diego (CA), USA, 2015. (Acceptance rate 28%.)
    software, Pre-print on Arxiv, doi:10.1137/1.9781611973754.11.
  8. H.M. Park, F. Silvestri, U Kang, and R. Pagh. MapReduce Triangle Enumeration With Guarantees. Proc. of 23rd ACM International Conference on Information and Knowledge Management (CIKM), pages 1739-1748, Shangai, China, 2014. (Acceptance rate 21%.)
    software, pdf, doi:10.1145/2661829.2662017.
  9. F. Silvestri. Subgraph Enumeration in Massive Graphs. 6th Workshop on Massive Data Algorithmics (no formal proceedings).
    Pre-print on Arxiv
  10. R. Pagh, F. Silvestri. The Input/Output Complexity of Triangle Enumeration. Proc. of 33rd ACM Symposium on Principles of Database Systems, pages 224-233, Snowbird (UT), USA, 2014. (Acceptance rate 33%.)
    pdf, slides, Pre-print on Arxiv, doi:10.1145/2594538.2594552.
  11. M. Scquizzato and F. Silvestri. Communication Lower Bounds for Distributed-Memory Computations. Proc. of 31st Symposium on Theoretical Aspects of Computer Science, LIPIcs 25, pages 627-638, 2014. (Acceptance rate 25.7%). Preliminary presented at the fifth Workshop on Massive Data Algorithmics (MASSIVE), Sophia Antipolis, 2013.
    pdf, slides, Pre-print on Arxiv, doi:LIPIcs.STACS.2014.627.
  12. A. Pietracaprina, G. Pucci, F. Silvestri, F. Vandin. Space-Efficient Parallel Algorithms for Combinatorial Search Problems. Proc. of 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 8087, pages 717-728, Klosterneuburg, Austria, 2013.
    pdf, slides, Full version on Arxiv (with all proofs), doi:10.1007/978-3-642-40313-2_63.
  13. P. Rech, L. Pilla, F. Silvestri, P. O. A. Navaux, and L. Carro. Neutron Sensitivity and Software Hardening Strategies for Matrix Multiplication and FFT on Graphics Processing Units. Proc. of 3rd Workshop on Fault-Tolerance for HPC at Extreme Scale, pages 13-20, New York, USA, 2013.
    pdf (pre-print), doi:10.1145/2465813.2465816.
  14. P. Rech, L. Pilla, F. Silvestri, C. Frost, P. O. A. Navaux, M. Sonza Reorda, and L. Carro. Neutron Sensitivity and Hardening Strategies for Fast Fourier Transform on GPUs. Proc. of 14th European Conference on Radiation and its Effects on Components and Systems (RADECS). 2013.
    doi:10.1109/RADECS.2013.6937457
  15. G. Bilardi, M. Scquizzato, and F. Silvestri. A lower bound technique for communication on BSP with application to the FFT. Proc. of 18th International Conference Euro-Par, LNCS 7484, pages 676-687, 2012.
    pdf, doi:10.1007/978-3-642-32820-6_67.
  16. A. Pietracaprina, G. Pucci, M. Riondato, F. Silvestri, and E. Upfal. Space-Round Tradeoffs for MapReduce Computations. Proc. of 26th ACM International Conference on Supercomputing, pages 235-244, Venice, Italy. 2012.
    pdf, Pre-print on Arxiv, BIBTEX entry, slides, doi:10.1145/2304576.2304607.
  17. S. Caminiti, I. Finocchi, E.G. Fusco, and F. Silvestri. Dynamic programming in faulty memory hierarchies (cache-obliviously). Proc. of 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), LIPIcs 13, pages 433-444, Mumbai, India, 2011. Preliminarly presented at the Third Workshop on Massive Data Algorithmics (MASSIVE), Paris, June 2011.
    pdf, BIBTEX entry, slides, doi:10.4230/LIPIcs.FSTTCS.2011.433.
  18. R. A. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandran. Oblivious Algorithms for Multicores and Network of Processors. In Proc. of the IEEE 24th International Parallel and Distributed Processing Symposium (IPDPS), pages 1-12, Atlanta, Georgia, April 19-23, 2010. (Best Paper Award in the Algorithms Track)
    pdf, pdf (preliminary technical report), BIBTEX entry, slides, doi:10.1109/IPDPS.2010.5470354.
  19. P. Bertasi, A. Pettarin, M. Scquizzato, and F. Silvestri. A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments. In Proc. of the 5th Symposium on Trustworthy Global Computing, LNCS 6084, pages 268-283, Munich, Germany, February 24-26, 2010.
    pdf, BIBTEX entry, slides, doi:10.1007/978-3-642-15640-3_18.
  20. G. Bilardi, A. Pietracaprina, G. Pucci, and F. Silvestri. Network-Oblivious Algorithms. In Proc. of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 1-10, Long Beach, California, USA, March 2007.
    pdf, slides, BIBTEX entry, doi 10.1109/IPDPS.2007.370243.
  21. F. Silvestri. On the Limits of Cache-Oblivious Matrix Transposition. In Proc. of the 2nd Symposium of Trustworthy Global Computing (TGC), LNCS 4661, pages 233-243, Lucca, Italy, 2006
    pdf, slides, BIBTEX entry, doi 10.1007/978-3-540-75336-0_15
  22. A. Pietracaprina, G. Pucci, and F. Silvestri. Cache-Oblivious Simulation of Parallel Programs. In Proc. of the 8th IEEE IPDPS Workshop on Advances in Parallel and Distributed Computational Models (APDCM), Rhodes Island, Greece, April 2006.
    pdf, slides, BIBTEX entry, doi:10.1109/IPDPS.2006.1639555

Software

  1. FN, a data structure for furthest neighbor queries (2015). (webpage).
  2. M3, an optimal MapReduce matrix multiplication library implemented in Hadoop (2014). (webpage).
  3. CTTP, an optimal randomized MapReduce algorithm for the problem of triangle enumeration implemented in Hadoop (2014). (webpage).
  4. mzRTree, a Java library for 2D range queries of proteomics data (2010). (webpage).

Manuscripts

  1. M. Aumüller, T. Christiani, R. Pagh, F. Silvestri. Distance-sensitive hashing. Submitted, 2017.
  2. H. M. Park, F. Silvestri, U Kang, R. Pagh, C.W. Chung, S.H. Myaeng. CTTP: Enumerating Triangles With Guarantees. (Journal version).
    software,
  3. G. Bilardi, M. Scquizzato, and F. Silvestri. A Lower Bound Technique for Communication on BSP with Application to the FFT. (Journal version)

Other publications

  1. F. Silvestri. Review of graph theory and interconnection networks, by Lih-Hsing Hsu and Cheng-Kuan Lin. SIGACT News 43(4), pages 30-34, 2012.
    pdf, doi:10.1145/2421119.2421125
  2. R. A. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandran, Oblivious Algorithms for Multicores and Network of Processors. The University of Texas at Austin, Department of Computer Science, TR-09-19, July 2009, 40 pages.
    pdf, BIBTEX entry
  3. F. Silvestri. Oblivious Computations on Memory and Network Hierarchies. Ph.D. Thesis, Supervisor A. Pietracaprina, University of Padova, 2009.
    pdf, BIBTEX entry,
  4. F. Silvestri. An Oblivious Approach to Parallel Algorithms. Poster for the 2008 IPDPS TCPP PhD Forum, Miami, Florida, USA, April 2008.
    Abstract (pdf), BIBTEX entry
  5. F. Silvestri. Network-Oblivious Algorithms. In Veli Mkinen, Greger Lindn, and Hannu Toivonen, editors, 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, May 2007.
    pdf (abstract+poster), BIBTEX entry
  6. F. Silvestri. Simulazione di algoritmi paralleli per il modello D-BSP su una gerarchia di cache ideali. "Laurea quinquennale" Thesis in Computer Science Engineering. Supervisors A. Pietracaprina and G. Pucci. University of Padova. (In Italian)
    pdf, BIBTEX entry

Copyright notice

The documents available from this site are provided as a means to ensure timely dissemination of technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder (ACM, IEEE, Springer-Verlag, Elsevier, etc.). Permission to make digital or hard copies of part or all of these works for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage. The electronic version of some of the works available from this site may differ from the definitive published version. Copyright of works submitted for publication may be transferred without further notice and this version may no longer be accessible.



You are visitor #