default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Silvestri 0001
Person information
- affiliation: University of Padova, Department of Information Engineering, Italy
- affiliation (former): IT University of Copenhagen, Denmark
Other persons with the same name
- Francesco Silvestri 0002 — Heidelberg University, Germany
- Francesco Silvestri 0003 — ITLink S.r.L., Navacchio, Italy
- Francesco Silvestri 0004 — University of Modena and Reggio Emilia, Department of Communication and Economics, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Riko Jacob
, Francesco Silvestri:
Unplugging Dijkstra's Algorithm as a Mechanical Device. CMSC 2024: 39-49- [c32]Lorenzo Padoan, Francesco Silvestri, Bruno Zamengo:
Mapping Passenger Trajectories to Train Schedules - industrial paper. SIGSPATIAL/GIS 2024: 444-453 - [c31]Lorenzo Padoan, Margherita Cesetti, Luca Brunello, Marco Antonelli, Bruno Zamengo, Francesco Silvestri:
Mobility ChatBot: supporting decision making in mobility data with chatbots. MDM 2024: 295-300 - [i27]Martin Aumüller, Fabrizio Boninsegna, Francesco Silvestri:
A Simple Linear Space Data Structure for ANN with Application in Differential Privacy. CoRR abs/2409.07187 (2024) - 2023
- [c30]Shiyuan Deng, Francesco Silvestri, Yufei Tao:
Enumerating Subgraphs of Constant Sizes in External Memory. ICDT 2023: 4:1-4:20 - [i26]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, Stefania Perri:
A Survey on Design Methodologies for Accelerating Deep Learning on Heterogeneous Architectures. CoRR abs/2311.17815 (2023) - 2022
- [j14]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling near neighbors in search for fairness. Commun. ACM 65(8): 83-90 (2022) - [j13]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? ACM Trans. Database Syst. 47(1): 4:1-4:40 (2022) - [c29]Paolo Sylos Labini, Massimo Bernaschi, Werner Nutt, Francesco Silvestri, Flavio Vella:
Blocking Sparse Matrices to Leverage Dense-Specific Multiplication. IA3@SC 2022: 19-24 - [i25]Paolo Sylos Labini, Massimo Bernaschi, Francesco Silvestri, Flavio Vella:
Blocking Techniques for Sparse Matrix Multiplication on Tensor Accelerators. CoRR abs/2202.05868 (2022) - [i24]Paolo Pellizzoni, Francesco Silvestri:
Dimensionality reduction on complex vector spaces for dynamic weighted Euclidean distance. CoRR abs/2212.06605 (2022) - 2021
- [j12]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Fair near neighbor search via sampling. SIGMOD Rec. 50(1): 42-49 (2021) - [c28]Elia Costa, Francesco Silvestri:
On the Bike Spreading Problem. ATMOS 2021: 5:1-5:16 - [c27]Rezaul Chowdhury, Francesco Silvestri, Flavio Vella:
Algorithm Design for Tensor Units. Euro-Par 2021: 353-367 - [i23]Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? CoRR abs/2101.10905 (2021) - [i22]Elia Costa, Francesco Silvestri:
On the Bike Spreading Problem. CoRR abs/2107.00761 (2021) - 2020
- [c26]Martin Aumüller, Rasmus Pagh, Francesco Silvestri:
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. PODS 2020: 191-204 - [c25]Thomas D. Ahle, Francesco Silvestri:
Similarity Search with Tensor Core Units. SISAP 2020: 76-84 - [c24]Rezaul Chowdhury, Francesco Silvestri, Flavio Vella:
A Computational Model for Tensor Core Units. SPAA 2020: 519-521 - [i21]Thomas D. Ahle, Francesco Silvestri:
Similarity Search with Tensor Core Units. CoRR abs/2006.12608 (2020)
2010 – 2019
- 2019
- [c23]Matteo Ceccarello, Anne Driemel, Francesco Silvestri:
FRESH: Fréchet Similarity with Hashing. WADS 2019: 254-268 - [i20]Martin Aumüller, Rasmus Pagh, Francesco Silvestri:
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. CoRR abs/1906.01859 (2019) - [i19]Francesco Silvestri, Flavio Vella:
A Computational Model for Tensor Core Units. CoRR abs/1908.06649 (2019) - 2018
- [j11]Ha-Myung Park, Francesco Silvestri, Rasmus Pagh, Chin-Wan Chung, Sung-Hyon Myaeng, U Kang:
Enumerating Trillion Subgraphs On Distributed Systems. ACM Trans. Knowl. Discov. Data 12(6): 71:1-71:30 (2018) - [j10]Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication in BSP. ACM Trans. Parallel Comput. 4(3): 14:1-14:27 (2018) - [c22]Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri:
Distance-Sensitive Hashing. PODS 2018: 89-104 - [c21]Samuel McCauley, Francesco Silvestri:
Adaptive MapReduce Similarity Joins. BeyondMR@SIGMOD 2018: 4:1-4:4 - [i18]Samuel McCauley, Francesco Silvestri:
Adaptive MapReduce Similarity Joins. CoRR abs/1804.05615 (2018) - [i17]Matteo Ceccarello, Anne Driemel, Francesco Silvestri:
FRESH: Fréchet Similarity with Hashing. CoRR abs/1809.02350 (2018) - 2017
- [j9]Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri:
Resilient Dynamic Programming. Algorithmica 77(2): 389-425 (2017) - [j8]Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel:
I/O-Efficient Similarity Join. Algorithmica 78(4): 1263-1283 (2017) - [j7]Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala:
Approximate furthest neighbor with application to annulus query. Inf. Syst. 64: 152-162 (2017) - [c20]Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri:
A Time-Space Trade-Off for Triangulations of Points in the Plane. COCOON 2017: 3-12 - [c19]Anne Driemel, Francesco Silvestri:
Locality-Sensitive Hashing of Curves. SoCG 2017: 37:1-37:16 - [c18]Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen:
Distance Sensitive Bloom Filters Without False Negatives. SODA 2017: 257-269 - [i16]Anne Driemel, Francesco Silvestri:
Locality-sensitive hashing of curves. CoRR abs/1703.04040 (2017) - [i15]Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri:
Distance-sensitive hashing. CoRR abs/1703.07867 (2017) - [i14]Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication in BSP. CoRR abs/1707.02229 (2017) - 2016
- [j6]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. J. ACM 63(1): 3:1-3:36 (2016) - [c17]Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri:
On the Complexity of Inner Product Similarity Join. PODS 2016: 151-164 - [i13]Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen:
Distance Sensitive Bloom Filters Without False Negatives. CoRR abs/1607.05451 (2016) - [i12]Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala:
Approximate Furthest Neighbor with Application to Annulus Query. CoRR abs/1611.07303 (2016) - 2015
- [j5]Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin:
Space-efficient parallel algorithms for combinatorial search problems. J. Parallel Distributed Comput. 76: 58-65 (2015) - [j4]Lorenzo De Stefani, Francesco Silvestri:
Exploiting non-constant safe memory in resilient algorithms and data structures. Theor. Comput. Sci. 583: 86-97 (2015) - [c16]Matteo Ceccarello, Francesco Silvestri:
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. ALENEX 2015: 119-132 - [c15]Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel:
I/O-Efficient Similarity Join. ESA 2015: 941-952 - [c14]Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala:
Approximate Furthest Neighbor in High Dimensions. SISAP 2015: 3-14 - [i11]Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel:
I/O-Efficient Similarity Join. CoRR abs/1507.00552 (2015) - [i10]Thomas D. Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri:
On the Complexity of Inner Product Similarity Join. CoRR abs/1510.02824 (2015) - 2014
- [c13]Ha-Myung Park, Francesco Silvestri, U Kang, Rasmus Pagh:
MapReduce Triangle Enumeration With Guarantees. CIKM 2014: 1739-1748 - [c12]Rasmus Pagh, Francesco Silvestri:
The input/output complexity of triangle enumeration. PODS 2014: 224-233 - [c11]Michele Scquizzato, Francesco Silvestri:
Communication Lower Bounds for Distributed-Memory Computations. STACS 2014: 627-638 - [i9]Francesco Silvestri:
Subgraph Enumeration in Massive Graphs. CoRR abs/1402.3444 (2014) - [i8]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. CoRR abs/1404.3318 (2014) - [i7]Matteo Ceccarello, Francesco Silvestri:
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. CoRR abs/1408.2858 (2014) - 2013
- [j3]Rezaul Alam Chowdhury, Vijaya Ramachandran, Francesco Silvestri, Brandon Blakeley:
Oblivious algorithms for multicores and networks of processors. J. Parallel Distributed Comput. 73(7): 911-925 (2013) - [c10]Paolo Rech, Laércio Lima Pilla, Francesco Silvestri, Philippe Olivier Alexandre Navaux, Luigi Carro:
Neutron sensitivity and software hardening strategies for matrix multiplication and FFT on graphics processing units. FTXS 2013: 13-20 - [c9]Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin:
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. MFCS 2013: 717-728 - [i6]Lorenzo De Stefani, Francesco Silvestri:
Exploiting non-constant safe memory in resilient algorithms and data structures. CoRR abs/1305.3828 (2013) - [i5]Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin:
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. CoRR abs/1306.2552 (2013) - [i4]Michele Scquizzato, Francesco Silvestri:
Communication Lower Bounds for Distributed-Memory Computations. CoRR abs/1307.1805 (2013) - [i3]Rasmus Pagh, Francesco Silvestri:
The Input/Output Complexity of Triangle Enumeration. CoRR abs/1312.0723 (2013) - 2012
- [j2]Francesco Silvestri:
Review of graph theory and interconnection networks, by Lih-Hsing Hsu and Cheng-Kuan Lin. SIGACT News 43(4): 30-34 (2012) - [c8]Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri:
A Lower Bound Technique for Communication on BSP with Application to the FFT. Euro-Par 2012: 676-687 - [c7]Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal:
Space-round tradeoffs for MapReduce computations. ICS 2012: 235-244 - 2011
- [c6]Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri:
Dynamic programming in faulty memory hierarchies (cache-obliviously). FSTTCS 2011: 433-444 - [i2]Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal:
Space-Round Tradeoffs for MapReduce Computations. CoRR abs/1111.2228 (2011) - 2010
- [c5]Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, Vijaya Ramachandran:
Oblivious algorithms for multicores and network of processors. IPDPS 2010: 1-12 - [c4]Paolo Bertasi, Alberto Pettarin, Michele Scquizzato, Francesco Silvestri:
A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments. TGC 2010: 268-283 - [i1]Sara Nasso, Francesco Silvestri, Francesco Tisiot, Barbara Di Camillo, Andrea Pietracaprina, Gianna Maria Toffolo:
An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree. CoRR abs/1002.3724 (2010)
2000 – 2009
- 2008
- [j1]Francesco Silvestri:
On the limits of cache-oblivious rational permutations. Theor. Comput. Sci. 402(2-3): 221-233 (2008) - 2007
- [c3]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri:
Network-Oblivious Algorithms. IPDPS 2007: 1-10 - 2006
- [c2]Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri:
Cache-oblivious simulation of parallel programs. IPDPS 2006 - [c1]Francesco Silvestri:
On the Limits of Cache-Oblivious Matrix Transposition. TGC 2006: 233-243
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
