Articles with public access mandates - Marco BressanLearn more
Not available anywhere: 1
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
Mandates: European Commission, Government of Italy
Available somewhere: 18
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
Mandates: European Commission, Government of Italy
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
Mandates: European Commission, Government of Italy
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
Mandates: European Commission, Government of Italy
Correlation clustering with adaptive similarity queries
M Bressan, N Cesa-Bianchi, A Paudice, F Vitale
Advances in Neural Information Processing Systems 32, 2019
Mandates: European Commission, Government of Italy
Faster algorithms for counting subgraphs in sparse graphs
M Bressan
Algorithmica 83, 2578-2605, 2021
Mandates: European Commission, Government of Italy
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
Mandates: European Commission, Government of Italy
Faster subgraph counting in sparse graphs
M Bressan
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019
Mandates: European Commission
Sublinear algorithms for local graph-centrality estimation
M Bressan, E Peserico, L Pretto
SIAM Journal on Computing 52 (4), 968-1008, 2023
Mandates: European Commission
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
Mandates: European Commission, Government of Italy
On approximating the stationary distribution of time-reversible Markov chains
M Bressan, E Peserico, L Pretto
Theory of Computing Systems 64 (3), 444-466, 2020
Mandates: European Commission, Government of Italy
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
Mandates: European Commission
Mixing time bounds for graphlet random walks
M Agostini, M Bressan, S Haddadan
Information Processing Letters 152, 105851, 2019
Mandates: European Commission, Government of Italy
Efficient and near-optimal algorithms for sampling connected subgraphs
M Bressan
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Mandates: European Commission
On margin-based cluster recovery with oracle queries
M Bressan, N Cesa-Bianchi, S Lattanzi, A Paudice
Advances in Neural Information Processing Systems 34, 25231-25243, 2021
Mandates: European Commission, Government of Italy
The complexity of pattern counting in directed graphs, parameterised by the outdegree
M Bressan, M Lanzinger, M Roth
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 542-552, 2023
Mandates: European Commission
Fully-dynamic decision trees
M Bressan, G Damay, M Sozio
Proceedings of the AAAI Conference on Artificial Intelligence 37 (6), 6842-6849, 2023
Mandates: European Commission, Agence Nationale de la Recherche
Active learning of classifiers with label and seed queries
M Bressan, N Cesa-Bianchi, S Lattanzi, A Paudice, M Thiessen
Advances in Neural Information Processing Systems 35, 30911-30922, 2022
Mandates: European Commission, Government of Italy
Margin-Based Active Learning of Classifiers
M Bressan, N Cesa-Bianchi, S Lattanzi, A Paudice
Journal of Machine Learning Research 25 (127), 1-45, 2024
Mandates: European Commission
Publication and funding information is determined automatically by a computer program