default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonardo Pellegrina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Leonardo Pellegrina, Fabio Vandin:
Efficient Discovery of Significant Patterns with Few-Shot Resampling. Proc. VLDB Endow. 17(10): 2668-2680 (2024)- [j6]Leonardo Pellegrina
, Fabio Vandin:
SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds. ACM Trans. Knowl. Discov. Data 18(3): 52:1-52:55 (2024) - [c9]Leonardo Pellegrina, Fabio Vandin:
Scalable Rule Lists Learning with Sampling. KDD 2024: 2352-2363 - [i6]Leonardo Pellegrina, Fabio Vandin:
Efficient Discovery of Significant Patterns with Few-Shot Resampling. CoRR abs/2406.11803 (2024) - [i5]Leonardo Pellegrina, Fabio Vandin:
Scalable Rule Lists Learning with Sampling. CoRR abs/2406.12803 (2024) - 2023
- [c8]Leonardo Pellegrina:
Efficient Centrality Maximization with Rademacher Averages. KDD 2023: 1872-1884 - [i4]Leonardo Pellegrina:
Efficient Centrality Maximization with Rademacher Averages. CoRR abs/2306.03651 (2023) - 2022
- [j5]Diego Santoro, Leonardo Pellegrina, Matteo Comin, Fabio Vandin:
SPRISS: approximating frequent k-mers by sampling reads, and applications. Bioinform. 38(13): 3343-3350 (2022) - [j4]Leonardo Pellegrina, Fabio Vandin:
Discovering significant evolutionary trajectories in cancer phylogenies. Bioinform. 38(Supplement_2): ii49-ii55 (2022) - [j3]Leonardo Pellegrina, Cyrus Cousins, Fabio Vandin, Matteo Riondato:
MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining. ACM Trans. Knowl. Discov. Data 16(6): 124:1-124:29 (2022) - 2021
- [i3]Leonardo Pellegrina, Fabio Vandin:
SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds. CoRR abs/2106.03462 (2021) - 2020
- [j2]Leonardo Pellegrina, Fabio Vandin:
Efficient mining of the most significant patterns with permutation testing. Data Min. Knowl. Discov. 34(4): 1201-1234 (2020) - [j1]Leonardo Pellegrina, Cinzia Pizzi, Fabio Vandin:
Fast Approximation of Frequent k-Mers and Applications to Metagenomics. J. Comput. Biol. 27(4): 534-549 (2020) - [c7]Leonardo Pellegrina, Cyrus Cousins, Fabio Vandin, Matteo Riondato:
MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining. KDD 2020: 2165-2174 - [i2]Leonardo Pellegrina, Cyrus Cousins, Fabio Vandin, Matteo Riondato:
MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining. CoRR abs/2006.09085 (2020) - [i1]Leonardo Pellegrina:
Sharper convergence bounds of Monte Carlo Rademacher Averages through Self-Bounding functions. CoRR abs/2010.12103 (2020)
2010 – 2019
- 2019
- [c6]Leonardo Pellegrina, Matteo Riondato, Fabio Vandin:
SPuManTE: Significant Pattern Mining with Unconditional Testing. KDD 2019: 1528-1538 - [c5]Leonardo Pellegrina, Matteo Riondato, Fabio Vandin:
Hypothesis Testing and Statistically-sound Pattern Mining. KDD 2019: 3215-3216 - [c4]Leonardo Pellegrina, Cinzia Pizzi, Fabio Vandin:
Fast Approximation of Frequent k-mers and Applications to Metagenomics. RECOMB 2019: 208-226 - 2018
- [c3]Leonardo Pellegrina, Fabio Vandin:
Efficient Mining of the Most Significant Patterns with Permutation Testing. KDD 2018: 2070-2079 - 2017
- [c2]Alex Badan, Luca Benvegnù, Matteo Biasetton, Giovanni Bonato, Alessandro Brighente, Alberto Cenzato, Piergiorgio Ceron, Giovanni Cogato, Stefano Marchesin, Alberto Minetto, Leonardo Pellegrina, Alberto Purpura, Riccardo Simionato, Nicolò Soleti, Matteo Tessarotto, Andrea Tonon, Federico Vendramin, Nicola Ferro:
Towards Open-Source Shared Implementations of Keyword-Based Access Systems to Relational Data. EDBT/ICDT Workshops 2017 - [c1]Alex Badan, Luca Benvegnù, Matteo Biasetton, Giovanni Bonato, Alessandro Brighente, Stefano Marchesin, Alberto Minetto, Leonardo Pellegrina, Alberto Purpura, Riccardo Simionato, Matteo Tessarotto, Andrea Tonon, Nicola Ferro:
Keyword-based access to relational data: To reproduce, or to not reproduce? SEBD 2017: 166
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-10 18:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
