Towards Open-Source Shared Implementations of Keyword-Based Access Systems to Relational Data. - Alex Badan; Luca Benvegnù; Matteo Biasetton; Giovanni Bonato; Alessandro Brighente; Alberto Cenzato; Piergiorgio Ceron; Giovanni Cogato; Stefano Marchesin 001; Alberto Minetto; Leonardo Pellegrina; Alberto Purpura; et al. (EDBT/ICDT Workshops, 2017)

Keyword-based access to relational data: To reproduce, or to not reproduce? - Alex Badan; Luca Benvegnù; Matteo Biasetton; Giovanni Bonato; Alessandro Brighente; Stefano Marchesin 001; Alberto Minetto; Leonardo Pellegrina; Alberto Purpura; Riccardo Simionato; Matteo Tessarotto; Andrea Tonon; et al. (SEBD, 2017)

SPuManTE: Significant Pattern Mining with Unconditional Testing. - Leonardo Pellegrina; Matteo Riondato; Fabio Vandin (KDD, 2019)

Hypothesis Testing and Statistically-sound Pattern Mining. - Leonardo Pellegrina; Matteo Riondato; Fabio Vandin (KDD, 2019)

Sharper convergence bounds of Monte Carlo Rademacher Averages through Self-Bounding functions. - Leonardo Pellegrina (CoRR, 2020)

Efficient mining of the most significant patterns with permutation testing. - Leonardo Pellegrina; Fabio Vandin (Data Min. Knowl. Discov., 2020)

Fast Approximation of Frequent k-Mers and Applications to Metagenomics. - Leonardo Pellegrina; Cinzia Pizzi; Fabio Vandin (J. Comput. Biol., 2020)

Discovering significant evolutionary trajectories in cancer phylogenies. - Leonardo Pellegrina; Fabio Vandin (Bioinform., 2022)

SPRISS: approximating frequent k-mers by sampling reads, and applications. - Diego Santoro; Leonardo Pellegrina; Matteo Comin; Fabio Vandin (Bioinform., 2022)

MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining. - Leonardo Pellegrina; Cyrus Cousins; Fabio Vandin; Matteo Riondato (ACM Trans. Knowl. Discov. Data, 2022)

Efficient Centrality Maximization with Rademacher Averages. - Leonardo Pellegrina (KDD, 2023)

Scalable Rule Lists Learning with Sampling. - Leonardo Pellegrina; Fabio Vandin (KDD, 2024)

SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds. - Leonardo Pellegrina; Fabio Vandin (ACM Trans. Knowl. Discov. Data, 2024)

Efficient Discovery of Significant Patterns with Few-Shot Resampling. - Leonardo Pellegrina; Fabio Vandin (Proc. VLDB Endow., 2024)