Marco Bressan

Assistant Professor

ARC team, Dept. of Computer Science, Sapienza Università di Roma

mail: mylastname at di dot uniroma1 dot it

Graph mining, motif counting, randomized algorithms

Recent publications

M. Bressan, E. Peserico, L. Pretto. Sublinear algorithms for local graph centrality estimation. IEEE FOCS 2018 (to appear; ArXiv full version).

M. Bressan, E. Peserico, L. Pretto. Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity. ACM SPAA 2018 (PDF).

M. Bressan, F. Chierichetti, R. Kumar, S. Leucci, A. Panconesi. Motif Counting Beyond Five Nodes. ACM TKDD, 12 (4), July 2018. (PDF)

M. Bressan, E. Peserico, L. Pretto. On Approximating the Stationary Distribution of Time-reversible Markov Chains. STACS 2018. (PDF)

M. Bressan, F. Chierichetti, R. Kumar, S. Leucci, A. Panconesi. Counting Graphlets: Space vs Time. ACM WSDM 2017. (PDF)


(See my DBLP entry for more)

Teaching

Fundamentals of Data Science and Laboratory (home page), 2017/2018, Master's Degree in Data Science

Customer Intelligence and Big Data (home page), 2017/2018, LUISS "Guido Carli"