| Counting graphlets: Space vs time M Bressan, F Chierichetti, R Kumar, S Leucci, A Panconesi Proceedings of the tenth ACM international conference on web search and data …, 2017 | 52 | 2017 |
| Choose the damping, choose the ranking? M Bressan, E Peserico Journal of Discrete Algorithms 8 (2), 199-213, 2010 | 36 | 2010 |
| Motif counting beyond five nodes M Bressan, F Chierichetti, R Kumar, S Leucci, A Panconesi ACM Transactions on Knowledge Discovery from Data (TKDD) 12 (4), 1-25, 2018 | 20 | 2018 |
| Local computation of PageRank: the ranking side M Bressan, L Pretto Proceedings of the 20th ACM international conference on Information and …, 2011 | 19 | 2011 |
| The Limits of Popularity-Based Recommendations, and the Role of Social Ties M Bressan, S Leucci, A Panconesi, P Raghavan, E Terolli ACM KDD, 2016 | 15 | 2016 |
| The power of local information in pagerank M Bressan, E Peserico, L Pretto Proceedings of the 22nd International Conference on World Wide Web, 179-180, 2013 | 14 | 2013 |
| Motivo: fast motif counting via succinct color coding and adaptive sampling M Bressan, S Leucci, A Panconesi PVLDB 12 (11), 1651-1663, 2019 | 10 | 2019 |
| Approximating pagerank locally with sublinear query complexity M Bressan, E Peserico, L Pretto arXiv preprint arXiv:1404.1864, 2014 | 9 | 2014 |
| psort 2011—pennysort, datamation, joulesort P Bertasi, F Bogo, M Bressan, E Peserico Jan, 2011 | 8 | 2011 |
| Simple set cardinality estimation through random sampling M Bressan, E Peserico, L Pretto arXiv preprint arXiv:1512.07901, 2015 | 7 | 2015 |
| Correlation clustering with adaptive similarity queries M Bressan, N Cesa-Bianchi, A Paudice, F Vitale arXiv preprint arXiv:1905.11902, 2019 | 5 | 2019 |
| On approximating the stationary distribution of time-reversible Markov chains M Bressan, E Peserico, L Pretto Theory of Computing Systems, 1-23, 2019 | 4 | 2019 |
| Sublinear algorithms for local graph centrality estimation M Bressan, E Peserico, L Pretto 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 4 | 2018 |
| Simple, Fast, Accurate Melanocytic Lesion Segmentation in 1D Colour Space. F Peruch, F Bogo, M Bonazza, M Bressan, VM Cappelleri, E Peserico VISAPP (1), 191-200, 2013 | 4 | 2013 |
| Faster subgraph counting in sparse graphs M Bressan arXiv preprint arXiv:1805.02089, 2018 | 3 | 2018 |
| Mixing time bounds for graphlet random walks M Agostini, M Bressan, S Haddadan Information Processing Letters 152, 105851, 2019 | 2 | 2019 |
| Brief announcement: On approximating PageRank locally with sublinear query complexity M Bressan, E Peserico, L Pretto Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 2 | 2018 |
| psort, Yet Another Fast Stable Sorting Software P Bertasi, M Bressan, E Peserico International Symposium on Experimental Algorithms, 76-88, 2009 | 2 | 2009 |
| Faster algorithms for sampling connected induced subgraphs M Bressan arXiv preprint arXiv:2007.12102, 2020 | 1 | 2020 |
| Exact Recovery of Mangled Clusters with Same-Cluster Queries M Bressan, N Cesa-Bianchi, S Lattanzi, A Paudice arXiv preprint arXiv:2006.04675, 2020 | 1 | 2020 |
Luca PrettoUniversità di PadovaVerified email at dei.unipd.it
