Developed the WebGraph framework for efficient compression of Web and social graphs. Invented new instantaneous codes for integers and aggressive algorithmic compression techniques. Introduced Layered Label Propagation to improve graph locality. Participated in the study of the largest publicly available Web snapshot in 2013, dispelling several myths about the Web. Developed the HyperBall algorithm for fast approximation of geometric centralities and neighborhood functions in large graphs. Used HyperBall to show that Facebook has four degrees of separation and to create the first open ranking of Wikipedia.
Research Experience
Currently a full professor at the Department of Informatics, University of Milan, and the head of the LAW. His research focuses on the compression, analysis, and ranking of Web and social graphs.
Education
Received a Laurea in Mathematics from the University of Milano in 1991 and a Ph.D. in Computer Science from the same university in 1996.
Background
Research interests include the compression and analysis of Web and social graphs, as well as the study of centrality measures. He has published numerous papers in these areas and developed several algorithms.
Miscellany
Personal interests include music and software development.