Francesco Silvestri

MaRDI QIDQ513271zbMATH OpenORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Enumerating subgraphs of constant sizes in external memory	2024-10-08	Paper
Algorithm design for tensor units	2022-03-31	Paper
FRESH: Fréchet similarity with hashing (available as arXiv preprint)	2020-01-16	Paper
Experimental evaluation of multi-round matrix multiplication on MapReduce 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)	2019-09-12	Paper
Locality-sensitive hashing of curves (available as arXiv preprint)	2018-08-13	Paper
Network-oblivious algorithms Journal of the ACM	2018-08-02	Paper
Distance sensitive Bloom filters without false negatives Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
A time-space trade-off for triangulations of points in the plane	2017-10-23	Paper
I/O-efficient similarity join Algorithmica	2017-10-10	Paper
A variant of the Lov\'asz-Theta number based on projection matrices	2017-08-22	Paper
Resilient dynamic programming Algorithmica	2017-03-03	Paper
scientific article; zbMATH DE number 6691438 (Why is no real title available?) (available as arXiv preprint)	2017-03-03	Paper
The LP-Newton Method and Conic Optimization	2016-11-28	Paper
Oblivious algorithms for multicores and networks of processors Journal of Parallel and Distributed Computing	2015-12-17	Paper
I/O-efficient similarity join Algorithms - ESA 2015	2015-11-19	Paper
Exploiting non-constant safe memory in resilient algorithms and data structures Theoretical Computer Science	2015-04-29	Paper
Space-Efficient Parallel Algorithms for Combinatorial Search Problems Mathematical Foundations of Computer Science 2013	2013-09-20	Paper
Dynamic programming in faulty memory hierarchies (cache-obliviously)	2012-08-31	Paper
On the Limits of Cache-Oblivious Matrix Transposition Trustworthy Global Computing	2009-03-05	Paper
On the limits of cache-oblivious rational permutations Theoretical Computer Science	2008-08-06	Paper

Research outcomes over time

This page was built for person: Francesco Silvestri