BRESSAN, MARCO
BRESSAN, MARCO
Dipartimento di Informatica Giovanni Degli Antoni
A Fine-grained Characterization of PAC Learnability
2025 M. Bressan, N. Brukhim, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
Of Dice and Games: A Theory of Generalized Boosting
2025 M. Bressan, N. Brukhim, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
Margin-based active learning of classifiers
2024 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees
2024 M. Bressan, M. Sozio
Counting Subgraphs in Somewhere Dense Graphs
2024 M. Bressan, L. Ann Goldberg, K. Meeks, M. Roth
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs
2024 M. Bressan, E. Esposito, M. Thiessen
A Theory of Interpretable Approximations
2024 M. Bressan, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
Efficient Streaming Algorithms for Graphlet Sampling
2024 Y. Bourreau, M. Bressan, T. Hubert Chan, Q. Kuang, M. Sozio
Fully-Dynamic Decision Trees
2023 M. Bressan, G. Damay, M. Sozio
Sublinear Algorithms for Local Graph-Centrality Estimation
2023 M. Bressan, E. Peserico, L. Pretto
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
2023 M. Bressan
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
2023 M. Bressan, M. Lanzinger, M. Roth
Counting Subgraphs in Somewhere Dense Graphs
2023 M. Bressan, L. Ann Goldberg, K. Meeks, M. Roth
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
2022 M. Bressan, M. Roth
Active Learning of Classifiers with Label and Seed Queries
2022 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice, M. Thiessen
Faster algorithms for counting subgraphs in sparse graphs
2021 M. Bressan
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
2021 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling
2021 M. Bressan, S. Leucci, A. Panconesi
Efficient and near-optimal algorithms for sampling connected subgraphs
2021 M. Bressan
On Margin-Based Cluster Recovery with Oracle Queries
2021 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice