Marco Bressan
Marco Bressan
University of Milan
Verified email at di.uniroma1.it - Homepage
Title
Cited by
Cited by
Year
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
622017
Choose the damping, choose the ranking?
M Bressan, E Peserico
Journal of Discrete Algorithms 8 (2), 199-213, 2010
372010
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
252018
Local computation of PageRank: the ranking side
M Bressan, L Pretto
Proceedings of the 20th ACM international conference on Information and …, 2011
192011
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
162016
Motivo: fast motif counting via succinct color coding and adaptive sampling
M Bressan, S Leucci, A Panconesi
PVLDB 12 (11), 1651-1663, 2019
152019
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
142013
Approximating pagerank locally with sublinear query complexity
M Bressan, E Peserico, L Pretto
arXiv preprint arXiv:1404.1864, 2014
92014
Simple set cardinality estimation through random sampling
M Bressan, E Peserico, L Pretto
arXiv preprint arXiv:1512.07901, 2015
82015
psort 2011—pennysort, datamation, joulesort
P Bertasi, F Bogo, M Bressan, E Peserico
Jan, 2011
82011
Faster subgraph counting in sparse graphs
M Bressan
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019
72019
Correlation clustering with adaptive similarity queries
M Bressan, N Cesa-Bianchi, A Paudice, F Vitale
arXiv preprint arXiv:1905.11902, 2019
62019
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
52018
Mixing time bounds for graphlet random walks
M Agostini, M Bressan, S Haddadan
Information Processing Letters 152, 105851, 2019
42019
On approximating the stationary distribution of time-reversible Markov chains
M Bressan, E Peserico, L Pretto
Theory of Computing Systems, 1-23, 2019
42019
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
42013
Faster algorithms for counting subgraphs in sparse graphs
M Bressan
Algorithmica, 1-28, 2021
22021
Exact Recovery of Mangled Clusters with Same-Cluster Queries
M Bressan, N Cesa-Bianchi, S Lattanzi, A Paudice
arXiv preprint arXiv:2006.04675, 2020
22020
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
22018
psort, Yet Another Fast Stable Sorting Software
P Bertasi, M Bressan, E Peserico
International Symposium on Experimental Algorithms, 76-88, 2009
22009
The system can't perform the operation now. Try again later.
Articles 1–20