Leonardo Pellegrina

Orcid: 0000-0002-6601-5526

According to our database1, Leonardo Pellegrina authored at least 11 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds.
ACM Trans. Knowl. Discov. Data, April, 2024

2023
Efficient Centrality Maximization with Rademacher Averages.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining.
ACM Trans. Knowl. Discov. Data, 2022

SPRISS: approximating frequent <i>k</i>-mers by sampling reads, and applications.
Bioinform., 2022

2020
Fast Approximation of Frequent k-Mers and Applications to Metagenomics.
J. Comput. Biol., 2020

Efficient mining of the most significant patterns with permutation testing.
Data Min. Knowl. Discov., 2020

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

2019
Hypothesis Testing and Statistically-sound Pattern Mining.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

SPuManTE: Significant Pattern Mining with Unconditional Testing.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

2017
Keyword-based access to relational data: To reproduce, or to not reproduce?
Proceedings of the 25th Italian Symposium on Advanced Database Systems, 2017

Towards Open-Source Shared Implementations of Keyword-Based Access Systems to Relational Data.
Proceedings of the Workshops of the EDBT/ICDT 2017 Joint Conference (EDBT/ICDT 2017), 2017


  Loading...