Journal papers

  1. 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.
    pdf (pre-print), arXiv, BIBTEX entry, doi:10.1016/j.jprot.2010.02.006.
  2. 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. S. Caminiti, I. Finocchi, E.G. Fusco, and F. Silvestri. Dynamic programming in faulty memory hierarchies (cache-obliviously). To appear on Proc. of 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), IIT Bombay, Mumbai, India, December 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.
  2. 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.
  3. 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.
  4. 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.
  5. 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
  6. 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

Work in progress

  1. A. Pietracaprina, G. Pucci, M. Riondato, F. Silvestri, and E. Upfal. Space-Round Tradeoffs for MapReduce Computations. In Arxiv:1111.2228, 2011.

Other publications

  1. 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
  2. F. Silvestri. Oblivious Computations on Memory and Network Hierarchies. Ph.D. Thesis, Supervisor A. Pietracaprina, University of Padova.
    pdf, BIBTEX entry,
  3. 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
  4. 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.
    Abstract (pdf), poster (pdf), BIBTEX entry
  5. 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

Misc

  1. F. Silvestri. Slides of the invited talk "Resilient Data Structures" at the Workshop on Recent Advances in Data Structures, IMSC Chennai, India, December 19th, 2011.
    pdf
  2. F. Silvestri. Lecture note on Data Stream for "Grandi moli di dati" course, May 2010 (in Italian).
    pdf (2010 version), (2008 version)
  3. F. Silvestri. Slides of the talk "On The Limits Of Cache And Network-Oblivious Matrix Transposition", ACT Seminar, Department of Computer Science, University of Texas, November 16th, 2007.
    pdf
  4. E. Salvagnin, F. Silvestri, C. Tagliacollo, F. Vandin. Ottimalità della codifica di Huffman. Final paper for "Gestione ed elaborazione di grandi moli di dati" course, June 2006 (in Italian).
    pdf
  5. E. Salvagnin, F. Silvestri, C. Tagliacollo, F. Vandin. Compressione e ricerca di dati XML: XBZip e XBZipIndex. Final paper for "Gestione ed elaborazione di grandi moli di dati" course, June 2006 (in Italian).
    pdf

My coauthors (just to feed search engines...)

Paolo Bertasi, Gianfranco Bilardi (DBLP), Brandon Blakeley, Bardbara Di Camillo, Saverio Caminiti, Rezaul Alam Chowdhury, Sara Nasso, Irene Finocchi, Emanuele G. Fusco, Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Vijaya Ramachandran, Michele Scquizzato, Francesco Tisiot, Gianna Maria Toffolo.

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 #