Antonio Piccolboni is a computer and data scientist. He holds a PhD in computer science from the University of Milan. His three-decade career has spanned computer theory, computational biology, data analysis and software engineering. His main claims to fame are the NP-completeness proof for the ground state problem in a combinatorial model of protein folding (which he would have never pulled off without the help of his co-authors)1 and an R package for large scale data analysis, rmr2, which has been downloaded more than 2 million times, making some practitioners very happy.
Pierluigi Crescenzi, Deborah Goldman, Christos Papadimitriou, Antonio Piccolboni, and Mihalis Yannakakis. “On the complexity of protein folding.” In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 597-603. 1998. ↩