Marco Bressan
Marco Bressan
Bestätigte E-Mail-Adresse bei di.uniroma1.it - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
372017
Choose the damping, choose the ranking?
M Bressan, E Peserico
Journal of Discrete Algorithms 8 (2), 199-213, 2010
302010
Local computation of PageRank: the ranking side
M Bressan, L Pretto
Proceedings of the 20th ACM international conference on Information and …, 2011
182011
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
122018
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
122013
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
92016
Approximating pagerank locally with sublinear query complexity
M Bressan, E Peserico, L Pretto
arXiv preprint arXiv:1404.1864, 2014
82014
Motivo: fast motif counting via succinct color coding and adaptive sampling
M Bressan, S Leucci, A Panconesi
PVLDB 12 (11), 1651-1663, 2019
62019
psort 2011–pennysort, datamation, joulesort
P Bertasi, F Bogo, M Bressan, E Peserico
Jan, 2011
62011
Simple set cardinality estimation through random sampling
M Bressan, E Peserico, L Pretto
arXiv preprint arXiv:1512.07901, 2015
52015
On approximating the stationary distribution of time-reversible Markov chains
M Bressan, E Peserico, L Pretto
Theory of Computing Systems, 1-23, 2019
32019
Correlation Clustering with Adaptive Similarity Queries
M Bressan, N Cesa-Bianchi, A Paudice, F Vitale
Advances in Neural Information Processing Systems, 12510-12519, 2019
32019
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
32013
psort, Yet Another Fast Stable Sorting Software
P Bertasi, M Bressan, E Peserico
International Symposium on Experimental Algorithms, 76-88, 2009
32009
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
22018
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
Counting subgraphs via DAG tree decompositions
M Bressan
arXiv preprint arXiv:1805.02089, 2018
12018
psort, yet another fast stable sorting software
P Bertasi, M Bressan, E Peserico
Journal of Experimental Algorithmics (JEA) 16, 2.1-2.19, 2011
12011
Mixing time bounds for graphlet random walks
M Agostini, M Bressan, S Haddadan
Information Processing Letters 152, 105851, 2019
2019
Faster subgraph counting in sparse graphs
M Bressan
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019
2019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20