Alessandro Epasto

I am a Research Scientist at Google, New York working in the Graph Mining team (part of the NYC Algorithm team) lead by Vahab Mirrokni. I received a Ph.D in computer science from Sapienza University of Rome, where I was advised by Professor Alessandro Panconesi and supported by the Google Europe Ph.D. Fellowship in Algorithms, 2011. I was also a post-doc at the department of computer science of Brown Univerisity in Providence (RI), USA where I was advised by Professor Eli Upfal. During my Ph.D. studies I was twice an intern at Google Mountain View (2012, 2014) and once at Google NYC (2013). My research interests include algorithmic problems in data mining in particular in the analysis of large-scale graphs and social networks.

Google Publications

Previous Publications

  •   

    Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic

    Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin

    In Proceedings of the 30th AAAI Conference on Artificial Intelligence 2016

  •   

    Efficient Algorithms for Public-Private Social Networks

    Flavio Chierichetti, Alessandro Epasto, Ravi Kumar, Silvio Lattanzi, Vahab Mirrokni

    KDD (2015)

  •   

    Efficient Densest Subgraph Computation in Evolving Graphs

    Alessandro Epasto, Silvio Lattanzi, Mauro Sozio

    WWW (2015)

  •  

    Communities, Random Walks, and Social Sybil Defense.

    Lorenzo Alvisi, Allen Clement, Alessandro Epasto, Silvio Lattanzi, Alessandro Panconesi

    Internet Mathematics (2014)

  •   

    Spreading Rumours without the Network

    Pawel Brach, Alessandro Epasto, Alessandro Panconesi, Piotr Sankovski

    In Proceedings of the 2nd ACM Conference on Social Networks, COSN, 2014

  •   

    Sok: The Evolution of Sybil Defense via Social Networks

    Lorenzo Alvisi, Allen Clement, Alessandro Epasto, Silvio Lattanzi, Alessandro Panconesi

    2013 IEEE Symposium on Security and Privacy, SP 2013