| 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 | 101 | 2017 |
| 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 | 56 | 2018 |
| Choose the damping, choose the ranking? M Bressan, E Peserico Journal of Discrete Algorithms 8 (2), 199-213, 2010 | 50 | 2010 |
| Motivo: fast motif counting via succinct color coding and adaptive sampling M Bressan, S Leucci, A Panconesi arXiv preprint arXiv:1906.01599, 2019 | 46 | 2019 |
| The limits of popularity-based recommendations, and the role of social ties M Bressan, S Leucci, A Panconesi, P Raghavan, E Terolli Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge …, 2016 | 26 | 2016 |
| Local computation of PageRank: the ranking side M Bressan, L Pretto Proceedings of the 20th ACM international conference on Information and …, 2011 | 23 | 2011 |
| Correlation clustering with adaptive similarity queries M Bressan, N Cesa-Bianchi, A Paudice, F Vitale Advances in Neural Information Processing Systems 32, 2019 | 20 | 2019 |
| 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 | 18 | 2013 |
| Faster algorithms for counting subgraphs in sparse graphs M Bressan Algorithmica 83, 2578-2605, 2021 | 17 | 2021 |
| Faster subgraph counting in sparse graphs M Bressan 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019 | 16 | 2019 |
| Exact recovery of clusters in finite metric spaces using oracle queries M Bressan, N Cesa-Bianchi, S Lattanzi, A Paudice Conference on Learning Theory, 775-803, 2021 | 14 | 2021 |
| 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 | 13 | 2018 |
| Simple set cardinality estimation through random sampling M Bressan, E Peserico, L Pretto arXiv preprint arXiv:1512.07901, 2015 | 13 | 2015 |
| Exact and approximate pattern counting in degenerate graphs: New algorithms, hardness results, and complexity dichotomies M Bressan, M Roth 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 12 | 2022 |
| Exact recovery of mangled clusters with same-cluster queries M Bressan, N Cesa-Bianchi, S Lattanzi, A Paudice Advances in Neural Information Processing Systems 33, 9324-9334, 2020 | 12 | 2020 |
| Approximating pagerank locally with sublinear query complexity M Bressan, E Peserico, L Pretto arXiv preprint arXiv:1404.1864, 2014 | 11 | 2014 |
| Faster motif counting via succinct color coding and adaptive sampling M Bressan, S Leucci, A Panconesi ACM Transactions on Knowledge Discovery from Data (TKDD) 15 (6), 1-27, 2021 | 9 | 2021 |
| Mixing time bounds for graphlet random walks M Agostini, M Bressan, S Haddadan Information Processing Letters 152, 105851, 2019 | 9 | 2019 |
| psort 2011—pennysort, datamation, joulesort P Bertasi, F Bogo, M Bressan, E Peserico Jan, 2011 | 8 | 2011 |
| Efficient and near-optimal algorithms for sampling connected subgraphs M Bressan Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 7* | 2021 |
Luca PrettoUniversità di PadovaVerified email at dei.unipd.it
