Francesco Silvestri

Orcid: 0000-0002-9077-9921

Affiliations:
  • University of Padova, Department of Information Engineering, Italy
  • IT University of Copenhagen, Denmark (former)


According to our database1, Francesco Silvestri authored at least 48 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Survey on Design Methodologies for Accelerating Deep Learning on Heterogeneous Architectures.
CoRR, 2023

Enumerating Subgraphs of Constant Sizes in External Memory.
Proceedings of the 26th International Conference on Database Theory, 2023

2022
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All?
ACM Trans. Database Syst., 2022

Dimensionality reduction on complex vector spaces for dynamic weighted Euclidean distance.
CoRR, 2022

Blocking Techniques for Sparse Matrix Multiplication on Tensor Accelerators.
CoRR, 2022

Sampling near neighbors in search for fairness.
Commun. ACM, 2022

Blocking Sparse Matrices to Leverage Dense-Specific Multiplication.
Proceedings of the 12th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, 2022

2021
Fair near neighbor search via sampling.
SIGMOD Rec., 2021

Algorithm Design for Tensor Units.
Proceedings of the Euro-Par 2021: Parallel Processing, 2021

On the Bike Spreading Problem.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
A Computational Model for Tensor Core Units.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Similarity Search with Tensor Core Units.
Proceedings of the Similarity Search and Applications - 13th International Conference, 2020

Fair Near Neighbor Search: Independent Range Sampling in High Dimensions.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

2019
A Computational Model for Tensor Core Units.
CoRR, 2019

FRESH: Fréchet Similarity with Hashing.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018
A Lower Bound Technique for Communication in BSP.
ACM Trans. Parallel Comput., 2018

Enumerating Trillion Subgraphs On Distributed Systems.
ACM Trans. Knowl. Discov. Data, 2018

Adaptive MapReduce Similarity Joins.
Proceedings of the 5th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, 2018

Distance-Sensitive Hashing.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

2017
Approximate furthest neighbor with application to annulus query.
Inf. Syst., 2017

I/O-Efficient Similarity Join.
Algorithmica, 2017

Resilient Dynamic Programming.
Algorithmica, 2017

Distance Sensitive Bloom Filters Without False Negatives.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Locality-Sensitive Hashing of Curves.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

A Time-Space Trade-Off for Triangulations of Points in the Plane.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Network-Oblivious Algorithms.
J. ACM, 2016

On the Complexity of Inner Product Similarity Join.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
Exploiting non-constant safe memory in resilient algorithms and data structures.
Theor. Comput. Sci., 2015

Space-efficient parallel algorithms for combinatorial search problems.
J. Parallel Distributed Comput., 2015

Approximate Furthest Neighbor in High Dimensions.
Proceedings of the Similarity Search and Applications - 8th International Conference, 2015

Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Subgraph Enumeration in Massive Graphs.
CoRR, 2014

Communication Lower Bounds for Distributed-Memory Computations.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

The input/output complexity of triangle enumeration.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

MapReduce Triangle Enumeration With Guarantees.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

2013
Oblivious algorithms for multicores and networks of processors.
J. Parallel Distributed Comput., 2013

Neutron sensitivity and software hardening strategies for matrix multiplication and FFT on graphics processing units.
Proceedings of the 3rd Workshop on Fault-tolerance for HPC at extreme scale, 2013

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

Space-round tradeoffs for MapReduce computations.
Proceedings of the International Conference on Supercomputing, 2012

A Lower Bound Technique for Communication on BSP with Application to the FFT.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011
Dynamic programming in faulty memory hierarchies (cache-obliviously).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree
CoRR, 2010

A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Oblivious algorithms for multicores and network of processors.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2008
On the limits of cache-oblivious rational permutations.
Theor. Comput. Sci., 2008

2007
Network-Oblivious Algorithms.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

2006
On the Limits of Cache-Oblivious Matrix Transposition.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Cache-oblivious simulation of parallel programs.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006


  Loading...