Cache-oblivious simulation of parallel programs. - Andrea Pietracaprina; Geppino Pucci; Francesco Silvestri 001 (IPDPS, 2006)

On the Limits of Cache-Oblivious Matrix Transposition. - Francesco Silvestri 001 (TGC, 2006)

Network-Oblivious Algorithms. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci; Francesco Silvestri 001 (IPDPS, 2007)

On the limits of cache-oblivious rational permutations. - Francesco Silvestri 001 (Theor. Comput. Sci., 2008)

Oblivious algorithms for multicores and network of processors. - Rezaul Alam Chowdhury; Francesco Silvestri 001; Brandon Blakeley; Vijaya Ramachandran (IPDPS, 2010)

A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments. - Paolo Bertasi; Alberto Pettarin; Michele Scquizzato; Francesco Silvestri 001 (TGC, 2010)

An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree - Sara Nasso; Francesco Silvestri 001; Francesco Tisiot; Barbara Di Camillo; Andrea Pietracaprina; Gianna Maria Toffolo (CoRR, 2010)

Dynamic programming in faulty memory hierarchies (cache-obliviously). - Saverio Caminiti; Irene Finocchi; Emanuele G. Fusco; Francesco Silvestri 001 (FSTTCS, 2011)

A Lower Bound Technique for Communication on BSP with Application to the FFT. - Gianfranco Bilardi; Michele Scquizzato; Francesco Silvestri 001 (Euro-Par, 2012)

Space-round tradeoffs for MapReduce computations. - Andrea Pietracaprina; Geppino Pucci; Matteo Riondato; Francesco Silvestri 001; Eli Upfal (ICS, 2012)

Review of graph theory and interconnection networks, by Lih-Hsing Hsu and Cheng-Kuan Lin. - Francesco Silvestri 001 (SIGACT News, 2012)

Neutron sensitivity and software hardening strategies for matrix multiplication and FFT on graphics processing units. - Paolo Rech; Laércio Lima Pilla; Francesco Silvestri 001; Philippe Olivier Alexandre Navaux; Luigi Carro (FTXS, 2013)

Oblivious algorithms for multicores and networks of processors. - Rezaul Alam Chowdhury; Vijaya Ramachandran; Francesco Silvestri 001; Brandon Blakeley (J. Parallel Distributed Comput., 2013)

MapReduce Triangle Enumeration With Guarantees. - Ha-Myung Park; Francesco Silvestri 001; U Kang; Rasmus Pagh (CIKM, 2014)

The input/output complexity of triangle enumeration. - Rasmus Pagh; Francesco Silvestri 001 (PODS, 2014)

Communication Lower Bounds for Distributed-Memory Computations. - Michele Scquizzato; Francesco Silvestri 001 (STACS, 2014)

Subgraph Enumeration in Massive Graphs. - Francesco Silvestri 001 (CoRR, 2014)

Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. - Matteo Ceccarello; Francesco Silvestri 001 (ALENEX, 2015)

Approximate Furthest Neighbor in High Dimensions. - Rasmus Pagh; Francesco Silvestri 001; Johan Sivertsen; Matthew Skala (SISAP, 2015)

Space-efficient parallel algorithms for combinatorial search problems. - Andrea Pietracaprina; Geppino Pucci; Francesco Silvestri 001; Fabio Vandin (J. Parallel Distributed Comput., 2015)

Exploiting non-constant safe memory in resilient algorithms and data structures. - Lorenzo De Stefani; Francesco Silvestri 001 (Theor. Comput. Sci., 2015)

On the Complexity of Inner Product Similarity Join. - Thomas Dybdahl Ahle; Rasmus Pagh; Ilya P. Razenshteyn; Francesco Silvestri 001 (PODS, 2016)

Network-Oblivious Algorithms. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci; Michele Scquizzato; Francesco Silvestri 001 (J. ACM, 2016)

A Time-Space Trade-Off for Triangulations of Points in the Plane. - Hee-Kap Ahn; Nicola Baraldo; Eunjin Oh 001; Francesco Silvestri 001 (COCOON, 2017)

Locality-Sensitive Hashing of Curves. - Anne Driemel; Francesco Silvestri 001 (SoCG, 2017)

Distance Sensitive Bloom Filters Without False Negatives. - Mayank Goswami 001; Rasmus Pagh; Francesco Silvestri 001; Johan Sivertsen (SODA, 2017)

Resilient Dynamic Programming. - Saverio Caminiti; Irene Finocchi; Emanuele G. Fusco; Francesco Silvestri 001 (Algorithmica, 2017)

I/O-Efficient Similarity Join. - Rasmus Pagh; Ninh Pham; Francesco Silvestri 001; Morten Stöckel (Algorithmica, 2017)

Approximate furthest neighbor with application to annulus query. - Rasmus Pagh; Francesco Silvestri 001; Johan Sivertsen; Matthew Skala (Inf. Syst., 2017)

Distance-Sensitive Hashing. - Martin Aumüller 001; Tobias Christiani; Rasmus Pagh; Francesco Silvestri 001 (PODS, 2018)

Adaptive MapReduce Similarity Joins. - Samuel McCauley; Francesco Silvestri 001 (BeyondMR@SIGMOD, 2018)

Enumerating Trillion Subgraphs On Distributed Systems. - Ha-Myung Park; Francesco Silvestri 001; Rasmus Pagh; Chin-Wan Chung; Sung-Hyon Myaeng; U Kang (ACM Trans. Knowl. Discov. Data, 2018)

A Lower Bound Technique for Communication in BSP. - Gianfranco Bilardi; Michele Scquizzato; Francesco Silvestri 001 (ACM Trans. Parallel Comput., 2018)

FRESH: Fréchet Similarity with Hashing. - Matteo Ceccarello; Anne Driemel; Francesco Silvestri 001 (WADS, 2019)

A Computational Model for Tensor Core Units. - Francesco Silvestri 001; Flavio Vella (CoRR, 2019)

Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. - Martin Aumüller 001; Rasmus Pagh; Francesco Silvestri 001 (PODS, 2020)

Similarity Search with Tensor Core Units. - Thomas D. Ahle; Francesco Silvestri 001 (SISAP, 2020)

A Computational Model for Tensor Core Units. - Rezaul Chowdhury; Francesco Silvestri 001; Flavio Vella (SPAA, 2020)

On the Bike Spreading Problem. - Elia Costa; Francesco Silvestri 001 (ATMOS, 2021)

Algorithm Design for Tensor Units. - Rezaul Chowdhury; Francesco Silvestri 001; Flavio Vella (Euro-Par, 2021)

Fair near neighbor search via sampling. - Martin Aumüller 001; Sariel Har-Peled; Sepideh Mahabadi; Rasmus Pagh; Francesco Silvestri 001 (SIGMOD Rec., 2021)

Blocking Sparse Matrices to Leverage Dense-Specific Multiplication. - Paolo Sylos Labini; Massimo Bernaschi; Werner Nutt; Francesco Silvestri 001; Flavio Vella (IA3@SC, 2022)

Sampling near neighbors in search for fairness. - Martin Aumüller 001; Sariel Har-Peled; Sepideh Mahabadi; Rasmus Pagh; Francesco Silvestri 001 (Commun. ACM, 2022)

Blocking Techniques for Sparse Matrix Multiplication on Tensor Accelerators. - Paolo Sylos Labini; Massimo Bernaschi; Francesco Silvestri 001; Flavio Vella (CoRR, 2022)

Dimensionality reduction on complex vector spaces for dynamic weighted Euclidean distance. - Paolo Pellizzoni; Francesco Silvestri 001 (CoRR, 2022)

Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? - Martin Aumüller 001; Sariel Har-Peled; Sepideh Mahabadi; Rasmus Pagh; Francesco Silvestri 001 (ACM Trans. Database Syst., 2022)

Enumerating Subgraphs of Constant Sizes in External Memory. - Shiyuan Deng; Francesco Silvestri 001; Yufei Tao 001 (ICDT, 2023)

A Survey on Design Methodologies for Accelerating Deep Learning on Heterogeneous Architectures. - Fabrizio Ferrandi; Serena Curzel; Leandro Fiorin; Daniele Ielmini; Cristina Silvano; Francesco Conti 001; Alessio Burrello; Francesco Barchi; Luca Benini; Luciano Lavagno; Teodoro Urso; Enrico Calore; et al. (CoRR, 2023)

Unplugging Dijkstra's Algorithm as a Mechanical Device. - Riko Jacob; Francesco Silvestri 001 (CMSC, 2024)

Mapping Passenger Trajectories to Train Schedules - industrial paper. - Lorenzo Padoan; Francesco Silvestri 001; Bruno Zamengo (SIGSPATIAL/GIS, 2024)

Mobility ChatBot: supporting decision making in mobility data with chatbots. - Lorenzo Padoan; Margherita Cesetti; Luca Brunello; Marco Antonelli; Bruno Zamengo; Francesco Silvestri 001 (MDM, 2024)

A Simple Linear Space Data Structure for ANN with Application in Differential Privacy. - Martin Aumüller 001; Fabrizio Boninsegna; Francesco Silvestri 001 (CoRR, 2024)

Differential Privacy Releasing of Hierarchical Origin/Destination Data with a TopDown Approach. - Fabrizio Boninsegna; Francesco Silvestri 001 (CoRR, 2024)

On Finding Hubs in High Dimensions with Sampling. - Huiwen Dong; Linghan Zeng; Zhiwen Zhao; Francesco Silvestri 001; Ninh Pham (AAAI, 2025)

Differentially Private High-Dimensional Approximate Range Counting, Revisited. - Martin Aumüller 001; Fabrizio Boninsegna; Francesco Silvestri 001 (FORC, 2025)

Accelerating Triangle Counting with Real Processing-in-Memory Systems. - Lorenzo Asquini; Manos Frouzakis; Juan Gómez-Luna; Mohammad Sadrosadati; Onur Mutlu; Francesco Silvestri 001 (IPDPS (Workshops), 2025)

Differentially Private Release of Hierarchical Origin/Destination Data with a TopDown Approach. - Fabrizio Boninsegna; Francesco Silvestri 001 (Proc. Priv. Enhancing Technol., 2025)

LEIT-motifs: Scalable Motif Mining in Multidimensional Time Series. - Matteo Ceccarello; Francesco Pio Monaco; Francesco Silvestri 001 (CoRR, 2025)

Design and testing of an agent chatbot supporting decision making with public transport data. - Luca Fantin; Marco Antonelli; Margherita Cesetti; Daniele Irto; Bruno Zamengo; Francesco Silvestri 001 (CoRR, 2025)