Marco Bressan

Assistant Professor
ARC group
Department of Computer Science
Sapienza University of Rome
bressan@di.uniroma1.it
Research
Large graph mining, information networks, randomized algorithms
Recent publications

Counting Graphlets: Space vs Time. (pdf)
Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi.
WSDM'17 (10th ACM International Conference on Web Search and Data Mining).

The Limits of Popularity-based Recommendations, and the Role of Social Ties. (pdf)
Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli.
KDD'16 (22nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining).

The Power of Local Information in PageRank.
Marco Bressan, Enoch Peserico, Luca Pretto.
CoRR abs/1604.00202, 2016.

Teaching
Fundamentals of Data Science, fall 2017 (Sapienza University).
Recent professional service
SODA 2016 (reviewer). ECAI 2016 (program committee).
Past positions

January to August 2015: senior researcher at Huawei Technologies' research center in Paris, France, in the parallel algorithms team.

January 2013 to December 2014: postdoc at INRIA Saclay, in the Learning&Optimization team (TAO) supported by CNRS, INRIA, and the Paris-Sud University.

Pre-2013: University of Padova (Italy) where I got my M.Sc. (2006) and Ph.D. (2011) from the Department of Information Engineering of the University of Padova.

Lead developer of psort, then the world's fastest external-memory sorting library (http://sortbenchmark.org).