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 year ↑


  1. Mapping Passenger Trajectories to Train Schedules - industrial paper
    Lorenzo Padoan, Bruno Zamengo and Francesco Silvestri. In Proc. 32nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2024), 2024.

  2. Unplugging Dijkstra’s algorithm as a mechanical device
    Riko Jacob and Francesco Silvestri. In Proc. Conference on Computer Science and Mathematics (CMSC), 2024.

  3. Mobility ChatBot: supporting decision making in mobility data with chatbots
    Lorenzo Padoan, Margherita Cesetti, Luca Brunello, Marco Antonelli, Bruno Zamengo and Francesco Silvestri. In Proc. 1st Workshop on Generative AI for Mobility Data (GenAIMoDA) at the 25th IEEE International Conference on Mobile Data Management, 2024.

  4. Covid-19 Pandemic’s Enduring Impact on Urban Mobility: The Case of Free-Floating Bike Sharing in Padova, Italy
    Margherita Cavattoni, Matteo Comin and Francesco Silvestri. In Transportation Research Record, 2024.

  5. A Survey on Design Methodologies for Accelerating Deep Learning on Heterogeneous Architectures
    Fabrizio Ferrandi, Serena Curzel, Leandro Fiorin, Daniele Ielmini, Cristina Silvano, Francesco Conti, Alessio Burrello, Francesco Barchi, Luca Benini, Luciano Lavagno, Teodoro Urso, Enrico Calore, Sebastiano Fabio Schifano, Cristian Zambelli, Maurizio Palesi, Giuseppe Ascia, Enrico Russo, Nicola Petra, Davide De Caro, Gennaro Di Meo, Valeria Cardellini, Salvatore Filippone, Francesco Lo Presti, Francesco Silvestri, Paolo Palazzari and Stefania Perri. 2023.

  6. Dimensionality reduction on complex vector spaces for dynamic weighted Euclidean distance
    Paolo Pellizzoni, Simone Moretti and Francesco Silvestri. 2023. Arxiv abs/2212.06605

  7. The I/O Complexity of Enumerating Subgraphs of Constant Sizes
    Shiyuan Deng, Francesco Silvestri and Yufei Tao. In Proc. 26th International Conference on Database Theory (ICDT), 2023. The paper received the ICDT Best Paper Award.

  8. Sampling near neighbors in search for fairness
    Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh and Francesco Silvestri. In Communication of the ACM, 65, 8, 83–90, 2022. This is a version of our ACM TODS 22 paper aimed at a broad audience. The paper has a nice technical perspective "Can data structures treat us fairly?" by Qin Zhang.

  9. Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All?
    Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh and Francesco Silvestri. In ACM Trans. Database Syst., 47, 1, 4:1–4:40, 2022. Based on our paper in PODS ’20 and the paper of Har-Peled and Mahabadi in NeurIPS ’19. An abridged version appeared in SIGMOD Record, March 2021, with a nice introduction by Qin Zhang. A version aimed at a broad audience appeared in Communications of the ACM, August 2022.

  10. Blocking Sparse Matrices to Leverage Dense-Specific Multiplication
    Paolo Sylos Labini, Massimo Bernaschi, Werner Nutt, Francesco Silvestri and Flavio Vella. In Proc. IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms (IA3), 2022.

  11. Machine learning approach to diabetic foot risk classification with biomechanics data
    A. Guiotto, G. Bortolami, A. Ciniglio, F. Spolaor, G. Guarneri, A. Avogaro, F. Cibin, F. Silvestri and Z. Sawacha. In Gait & Posture, 97, 30 - 31, 2022. Abstract from SIAMOC 2022

  12. On the Bike Spreading Problem
    Elia Costa and Francesco Silvestri. In Proc. 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), 2021.

  13. Algorithm design for Tensor Units
    Rezaul Chowdhury, Francesco Silvestri and Flavio Vella. In Proc. 27th International European Conference on Parallel and Distributed Computing (EURO-PAR), 2021. Extended version of SPAA 2020 Brief Announcement

  14. Fair near neighbor search via sampling
    Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh and Francesco Silvestri. In ACM SIGMOD Record, 50, 1, 42–49, 2021.

  15. Similarity Search with Tensor Core Units
    Thomas D. Ahle and Francesco Silvestri. In Proc. 13th International Conference on Similarity Search and Applications (SISAP), 2020.

  16. Brief Announcement: A Computational Model for Tensor Core Units
    Rezaul Chowdhury, Francesco Silvestri and Flavio Vella. In Proc. 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020. The full version has been published in EURO-PAR 2021 with title "Algorithm design for Tensor Units".

  17. Fair Near Neighbor Search: Independent Range Sampling in High Dimensions
    Martin Aumüller, Rasmus Pagh and Francesco Silvestri. In Proc. of Symposium on Principles of Database Systems (PODS), 2020. The paper was awarded with the ACM SIGMOD Research Highlights Awards 2020

  18. Novel subgroups of diabetic patients with and without neuropathy and their association with clinical outcomes: a 15 years follow up study based on gait analysis driven cluster analysis
    A. Guiotto, M. Soldan, F. Silvestri, F. Spolaor, G. Guarnieri, A. Avogaro and Z. Sawacha. In Gait & Posture, 74, 21 - 22, 2019. Abstract from SIAMOC 2019

  19. FRESH: Fréchet Similarity with Hashing
    Matteo Ceccarello, Anne Driemel and Francesco Silvestri. In Proc. of Algorithms and Data Structures Symposium (WADS), 2019.

  20. Enumerating Trillion Subgraphs On Distributed Systems
    Ha-Myung Park, Francesco Silvestri, Rasmus Pagh, Chin-Wan Chung, Sung-Hyon Myaeng and U Kang. In ACM Transactions on Knowledge Discovery from Data, 12, 2018.

  21. Adaptive MapReduce Similarity Join
    Samuel McCauley and Francesco Silvestri. In Proc. of Workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR), 2018.

  22. Distance-sensitive hashing
    Martin Aumüller, Tobias Christiani, Rasmus Pagh and Francesco Silvestri. In Proc. 37th ACM Symposium on Principles of Database Systems (PODS), 2018. (Acceptance rate 35%.)

  23. A Lower Bound Technique for Communication in BSP
    Gianfranco Bilardi, Michele Scquizzato and Francesco Silvestri. In ACM Transactions on Parallel Computing, 4, 3, 14:1–14:27, 2018.

  24. 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. (Acceptance rate 35%.)

  25. 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.

  26. 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%.)

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

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

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

  30. 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.

  31. 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%.)

  32. 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.

  33. 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%.)

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

  35. 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.

  36. 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%.)

  37. 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.

  38. 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%.)

  39. Subgraph Enumeration in Massive Graphs
    Francesco Silvestri. In Proc. 6th Workshop on Massive Data Algorithmics (MASSIVE), 2014. A stronger version of this paper has been published in ICDT 2023 jointly with Shiyuan Deng and Yufei Tao.

  40. 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%.)

  41. 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.

  42. 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%)

  43. 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.

  44. 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.

  45. 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.

  46. 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.

  47. 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.

  48. 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.

  49. 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.

  50. 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.

  51. 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.

  52. 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.

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

  54. 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.

  55. On the Limits of Cache-Oblivious Matrix Transposition
    Francesco Silvestri. In Proc. of the 2nd Symposium of Trustworthy Global Computing (TGC), 4661 : 233–243, LNCS, 2007.

  56. 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.

Other documents ↑


  1. Learning urban areas from tourist data: a case study with spatially constrained clustering and Airbnb data
    Eddie Rossi, Marco Agnolon, Bruno Zamengo and Francesco Silvestri. 2023. Short presentation at 9th International Conference on Computational Social Science (IC2S2)

  2. I Want to Ride my Bicycle: Leveraging Mobike Data to Study Mobility in Padova, Italy
    Pietro Rampazzo, Katherine Hoffmann Pham, Francesco Rampazzo and Francesco Silvestri. 2020. Poster at 6th International Conference on Computational Social Science (IC2S2)

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

  4. Oblivious Computations on Memory and Network Hierarchies
    Francesco Silvestri. University of Padova 2009. PhD Thesis, supervisor A. Pietracaprina.

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

  6. 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.

  7. 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.