default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Bressan 0002
Person information
- affiliation: University of Milan, Italy
- affiliation (former): Sapienza University of Rome, Italy
Other persons with the same name
- Marco Bressan 0001 — Univ. Autonoma de Barcelona, Spain
- Marco Bressan 0003 — Xerox Research Centre Europe, France
- Marco Bressan 0004 — Satellogic, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Margin-Based Active Learning of Classifiers. J. Mach. Learn. Res. 25: 127:1-127:45 (2024)- [j11]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. SIAM J. Comput. 53(5): 1409-1438 (2024) - [c26]Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen:
A Theory of Interpretable Approximations. COLT 2024: 648-668 - [c25]Marco Bressan, Emmanuel Esposito, Maximilian Thiessen:
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs. COLT 2024: 669-696 - [c24]Marco Bressan, Mauro Sozio:
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees. ICML 2024 - [i21]Marco Bressan, Emmanuel Esposito, Maximilian Thiessen
:
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs. CoRR abs/2405.00853 (2024) - [i20]Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen:
A Theory of Interpretable Approximations. CoRR abs/2406.10529 (2024) - 2023
- [j10]Marco Bressan, Enoch Peserico, Luca Pretto:
Sublinear Algorithms for Local Graph-Centrality Estimation. SIAM J. Comput. 52(4): 968-1008 (2023) - [j9]Marco Bressan:
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs. ACM Trans. Algorithms 19(3): 26:1-26:40 (2023) - [c23]Marco Bressan, Gabriel Damay, Mauro Sozio:
Fully-Dynamic Decision Trees. AAAI 2023: 6842-6849 - [c22]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. ITCS 2023: 27:1-27:14 - [c21]Marco Bressan, Matthias Lanzinger, Marc Roth:
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. STOC 2023: 542-552 - [i19]Marco Bressan, Mauro Sozio:
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees. CoRR abs/2302.03994 (2023) - 2022
- [c20]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen:
Active Learning of Classifiers with Label and Seed Queries. NeurIPS 2022 - [i18]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. CoRR abs/2209.03402 (2022) - [i17]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen:
Active Learning of Classifiers with Label and Seed Queries. CoRR abs/2209.03996 (2022) - [i16]Marco Bressan, Matthias Lanzinger, Marc Roth:
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. CoRR abs/2211.01905 (2022) - [i15]Marco Bressan, Gabriel Damay, Mauro Sozio:
Fully-Dynamic Decision Trees. CoRR abs/2212.00778 (2022) - 2021
- [j8]Marco Bressan:
Faster algorithms for counting subgraphs in sparse graphs. Algorithmica 83(8): 2578-2605 (2021) - [j7]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling. ACM Trans. Knowl. Discov. Data 15(6): 96:1-96:27 (2021) - [c19]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. COLT 2021: 775-803 - [c18]Marco Bressan, Marc Roth:
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. FOCS 2021: 276-285 - [c17]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
On Margin-Based Cluster Recovery with Oracle Queries. NeurIPS 2021: 25231-25243 - [c16]Marco Bressan:
Efficient and near-optimal algorithms for sampling connected subgraphs. STOC 2021: 1132-1143 - [i14]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. CoRR abs/2102.00504 (2021) - [i13]Marco Bressan, Marc Roth:
Counting homomorphisms, subgraphs, and induced subgraphs in degenerate graphs: new hardness results and complete complexity classifications. CoRR abs/2103.05588 (2021) - [i12]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
On Margin-Based Cluster Recovery with Oracle Queries. CoRR abs/2106.04913 (2021) - 2020
- [j6]Marco Bressan, Enoch Peserico, Luca Pretto:
On Approximating the Stationary Distribution of Time-Reversible Markov Chains. Theory Comput. Syst. 64(3): 444-466 (2020) - [c15]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Mangled Clusters with Same-Cluster Queries. NeurIPS 2020 - [i11]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Mangled Clusters with Same-Cluster Queries. CoRR abs/2006.04675 (2020) - [i10]Marco Bressan:
Faster algorithms for sampling connected induced subgraphs. CoRR abs/2007.12102 (2020) - [i9]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Faster motif counting via succinct color coding and adaptive sampling. CoRR abs/2009.03052 (2020)
2010 – 2019
- 2019
- [j5]Matteo Agostini, Marco Bressan, Shahrzad Haddadan:
Mixing time bounds for graphlet random walks. Inf. Process. Lett. 152 (2019) - [j4]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling. Proc. VLDB Endow. 12(11): 1651-1663 (2019) - [c14]Marco Bressan:
Faster Subgraph Counting in Sparse Graphs. IPEC 2019: 6:1-6:15 - [c13]Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale:
Correlation Clustering with Adaptive Similarity Queries. NeurIPS 2019: 12510-12519 - [i8]Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale:
Correlation Clustering with Adaptive Similarity Queries. CoRR abs/1905.11902 (2019) - [i7]Marco Bressan, Stefano Leucci, Alessandro Panconesi:
Motivo: fast motif counting via succinct color coding and adaptive sampling. CoRR abs/1906.01599 (2019) - 2018
- [j3]Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi:
Motif Counting Beyond Five Nodes. ACM Trans. Knowl. Discov. Data 12(4): 48:1-48:25 (2018) - [c12]Marco Bressan, Enoch Peserico, Luca Pretto:
Sublinear Algorithms for Local Graph Centrality Estimation. FOCS 2018: 709-718 - [c11]Marco Bressan, Enoch Peserico, Luca Pretto:
Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity. SPAA 2018: 87-89 - [c10]Marco Bressan, Enoch Peserico, Luca Pretto:
On Approximating the Stationary Distribution of Time-reversible Markov Chains. STACS 2018: 18:1-18:14 - [i6]Marco Bressan, Enoch Peserico, Luca Pretto:
On approximating the stationary distribution of time-reversible Markov chains. CoRR abs/1801.00196 (2018) - [i5]Marco Bressan:
On degeneracy and the parameterized complexity of subgraph counting. CoRR abs/1805.02089 (2018) - 2017
- [c9]Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi:
Counting Graphlets: Space vs Time. WSDM 2017: 557-566 - 2016
- [c8]Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli:
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. KDD 2016: 745-754 - [i4]Marco Bressan, Enoch Peserico, Luca Pretto:
The Power of Local Information in PageRank. CoRR abs/1604.00202 (2016) - [i3]Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli:
The Limits of Popularity-Based Recommendations, and the Role of Social Ties. CoRR abs/1607.04263 (2016) - 2015
- [i2]Marco Bressan, Enoch Peserico, Luca Pretto:
Simple set cardinality estimation through random sampling. CoRR abs/1512.07901 (2015) - 2014
- [i1]Marco Bressan, Enoch Peserico, Luca Pretto:
Approximating PageRank locally with sublinear query complexity. CoRR abs/1404.1864 (2014) - 2013
- [c7]Francesco Peruch, Federica Bogo, Michele Bonazza, Marco Bressan, Vincenzo-Maria Cappelleri, Enoch Peserico:
Simple, Fast, Accurate Melanocytic Lesion Segmentation in 1D Colour Space. VISAPP (1) 2013: 191-200 - [c6]Marco Bressan, Enoch Peserico, Luca Pretto:
The power of local information in PageRank. WWW (Companion Volume) 2013: 179-180 - 2011
- [b1]Marco Bressan:
Ranking robustly. University of Padua, Italy, 2011 - [j2]Paolo Bertasi, Marco Bressan, Enoch Peserico:
psort, yet another fast stable sorting software. ACM J. Exp. Algorithmics 16 (2011) - [c5]Marco Bressan, Luca Pretto:
Local computation of PageRank: the ranking side. CIKM 2011: 631-640 - [c4]Paolo Bertasi, Michele Bonazza, Marco Bressan, Enoch Peserico:
Datamation: A Quarter of a Century and Four Orders of Magnitude Later. CLUSTER 2011: 605-609 - 2010
- [j1]Marco Bressan, Enoch Peserico:
Choose the damping, choose the ranking? J. Discrete Algorithms 8(2): 199-213 (2010) - [c3]Marco Bressan, Enoch Peserico:
Urban Hitchhiking. FUN 2010: 68-76
2000 – 2009
- 2009
- [c2]Marco Bressan, Enoch Peserico:
Choose the Damping, Choose the Ranking?. WAW 2009: 76-89 - [c1]Paolo Bertasi, Marco Bressan, Enoch Peserico:
psort, Yet Another Fast Stable Sorting Software. SEA 2009: 76-88
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 2024-10-22 21:18 CEST 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:
