| Oblivious algorithms for multicores and networks of processors RA Chowdhury, V Ramachandran, F Silvestri, B Blakeley Journal of Parallel and Distributed Computing 73 (7), 911-925, 2013 | 126 | 2013 |
| MapReduce Triangle Enumeration With Guarantees HM Park, F Silvestri, U Kang, R Pagh 23rd ACM International Conference on Information and Knowledge Management …, 2014 | 101 | 2014 |
| The Input/Output Complexity of Triangle Enumeration R Pagh, F Silvestri 33rd ACM Symposium on Principles of Database Systems, 224-233, 2014 | 89 | 2014 |
| Space-Round Tradeoffs for MapReduce Computations A Pietracaprina, G Pucci, M Riondato, F Silvestri, E Upfal 26th ACM international conference on Supercomputing, 235-244, 2012 | 84 | 2012 |
| Locality-sensitive hashing of curves A Driemel, F Silvestri arXiv preprint arXiv:1703.04040, 2017 | 80 | 2017 |
| On the Complexity of Inner Product Similarity Join TD Ahle, R Pagh, I Razenshteyn, F Silvestri Proc. 35th ACM Symposium on Principles of Database Systems, 2016 | 54 | 2016 |
| Software-Based Hardening Strategies for Neutron Sensitive FFT Algorithms on GPUs LL Pilla, P Rech, F Silvestri, C Frost, POA Navaux, MS Reorda, L Carro IEEE Transactions on Nuclear Science 61 (4), 1874 - 1880, 2014 | 52 | 2014 |
| Distance-sensitive hashing M Aumüller, T Christiani, R Pagh, F Silvestri Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018 | 38 | 2018 |
| Approximate furthest neighbor in high dimensions R Pagh, F Silvestri, J Sivertsen, M Skala Proc. 8th Int. Conference on Similarity Search and Applications (SISAP), 3-14, 2015 | 36 | 2015 |
| I/O-efficient similarity join R Pagh, N Pham, F Silvestri, M Stöckel Proc. of 23rd Annual European Symposium on Algorithms 9294, 941-952, 2015 | 35 | 2015 |
| Fair near neighbor search: Independent range sampling in high dimensions M Aumüller, R Pagh, F Silvestri Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020 | 29 | 2020 |
| Fair near neighbor search via sampling M Aumuller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri ACM SIGMOD Record 50 (1), 42-49, 2021 | 28 | 2021 |
| Communication Lower Bounds for Distributed-Memory Computations M Scquizzato, F Silvestri 31st Symposium on Theoretical Aspects of Computer Science, 627-638, 2014 | 28 | 2014 |
| Distance sensitive bloom filters without false negatives M Goswami, R Pagh, F Silvestri, J Sivertsen Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 25 | 2017 |
| Network-oblivious algorithms G Bilardi, A Pietracaprina, G Pucci, F Silvestri 2007 IEEE International Parallel and Distributed Processing Symposium, 1-10, 2007 | 24 | 2007 |
| FRESH: Fréchet similarity with hashing M Ceccarello, A Driemel, F Silvestri Workshop on Algorithms and Data Structures, 254-268, 2019 | 22 | 2019 |
| A Lower Bound Technique for Communication on BSP with Application to the FFT G Bilardi, M Scquizzato, F Silvestri 18th International Conference Euro-Par, pages 676-687, 2012 | 22 | 2012 |
| Brief announcement: a computational model for tensor core units R Chowdhury, F Silvestri, F Vella Proc. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA …, 2020 | 21 | 2020 |
| Blocking Sparse Matrices to Leverage Dense-Specific Multiplication PS Labini, M Bernaschi, W Nutt, F Silvestri, F Vella 2022 IEEE/ACM Workshop on Irregular Applications: Architectures and …, 2022 | 20* | 2022 |
| Sampling a near neighbor in high dimensions—who is the fairest of them all? M Aumüller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri ACM Transactions on Database Systems (TODS) 47 (1), 1-40, 2022 | 20 | 2022 |
Rasmus PaghProfessor of computer science, University of CopenhagenVerified email at di.ku.dk
