I’m a Research Fellow (RTD-A) at the Department of Computer Science of the University of Pisa, where I am a member of the A³ Lab.
I received a PhD in Computer Science from the University of Pisa in 2022, under the supervision of Prof. Paolo Ferragina, with a thesis on Learning-based compressed data structures, that is, data structures that achieve new space-time trade-offs compared to traditional solutions by learning, in a rigorous and efficient algorithmic way, the regularities in the input data with tools from machine learning and computational geometry. The thesis was awarded the Best PhD thesis in Theoretical Computer Science by the Italian Chapter of the EATCS. During my PhD, I spent a research period at Harvard University, hosted by Prof. Stratos Idreos.
My research is supported by: the SoBigData.it project funded by the European Union - NextGenerationEU - Italy’s National Recovery and Resilience Plan (PNRR) and the SoBigData++ project funded by the European Union - Horizon 2020. In the past, I was supported by the Multicriteria data structures project funded by the Italian Ministry of University and Research.
PhD in Computer Science, 2018–21
University of Pisa
MSc in Computer Science, 2016–18
University of Pisa
BSc in Computer Science, 2013–16
University of Pisa
Program committees:
WSDM 2024, AIME 2024, BIBM 2024, BIBM 2023, WSDM 2023
Organising committees:
SPIRE 2023
Journal reviewer:
IEEE Trans. Knowl. Data Eng., IEEE Trans. Cloud Comput., IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., VLDB J., J. Inf. Secur. Appl., Software: Pract. Exp., Neurocomputing, PLOS ONE
Conference reviewer:
SIGIR 2024, SPIRE 2023, SAND 2023, ALENEX 2022, DCC 2022, LATIN 2022
Teacher:
Teaching assistant:
Co-supervised theses:
A monotone minimal perfect hash function that learns and leverages the data smoothness.
Compressed rank/select dictionary based on Lempel-Ziv and LA-vector compression.
Implementation of two LZ-End parsing algorithms.
Proof-of-concept extension of the PGM-index to support fixed-length strings.
Compressed string dictionary based on rear-coding.
Compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
Compressed bitvector/container supporting efficient random access and rank queries.
Python library of sorted containers with state-of-the-art query performance and compressed memory usage.
Data structure enabling fast searches in arrays of billions of items using orders of magnitude less space than traditional indexes.
C++11 implementation of the Cache Sensitive Search tree.
Python library to build and train feedforward neural networks, with hyperparameters tuning capabilities.
Knowledge is like a sphere; the greater its volume, the larger its contact with the unknown.
― Blaise Pascal