A Visualization Tool of Probabilistic Models for Information Access Components. - Lorenzo De Stefani; Giorgio Maria Di Nunzio; Giorgio Vezzaro (ECDL, 2009)

Exploiting non-constant safe memory in resilient algorithms and data structures. - Lorenzo De Stefani; Francesco Silvestri 001 (Theor. Comput. Sci., 2015)

Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic. - Lorenzo De Stefani; Alessandro Epasto; Eli Upfal; Fabio Vandin (AAAI, 2016)

Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams. - Lorenzo De Stefani; Erisa Terolli; Eli Upfal (IEEE BigData, 2017)

Toward Sustainable Insights, or Why Polygamy is Bad for You. - Carsten Binnig; Lorenzo De Stefani; Tim Kraska; Eli Upfal; Emanuel Zgraggen; Zheguang Zhao (CIDR, 2017)

Controlling False Discoveries During Interactive Data Exploration. - Zheguang Zhao; Lorenzo De Stefani; Emanuel Zgraggen; Carsten Binnig; Eli Upfal; Tim Kraska (SIGMOD Conference, 2017)

Safe Visual Data Exploration. - Zheguang Zhao; Emanuel Zgraggen; Lorenzo De Stefani; Carsten Binnig; Eli Upfal; Tim Kraska (SIGMOD Conference, 2017)

The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. - Gianfranco Bilardi; Lorenzo De Stefani (WADS, 2017)

TRIÈST: Counting Local and Global Triangles in Fully Dynamic Streams with Fixed Memory Size. - Lorenzo De Stefani; Alessandro Epasto; Matteo Riondato; Eli Upfal (ACM Trans. Knowl. Discov. Data, 2017)

VizRec: A framework for secure data exploration via visual representation. - Lorenzo De Stefani; Leonhard F. Spiegelberg; Tim Kraska; Eli Upfal (CoRR, 2018)

VizCertify: A Framework for Secure Visual Data Exploration. - Lorenzo De Stefani; Leonhard F. Spiegelberg; Eli Upfal; Tim Kraska (DSAA, 2019)

A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis. - Lorenzo De Stefani; Eli Upfal (DSAA, 2019)

The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication. - Lorenzo De Stefani (ISAAC, 2019)

The I/O complexity of Toom-Cook integer multiplication. - Gianfranco Bilardi; Lorenzo De Stefani (SODA, 2019)

A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis. - Lorenzo De Stefani; Eli Upfal (CoRR, 2019)

On the I/O complexity of hybrid algorithms for Integer Multiplication. - Lorenzo De Stefani (CoRR, 2019)

Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model. - Lorenzo De Stefani (CoRR, 2020)

Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams. - Lorenzo De Stefani; Erisa Terolli; Eli Upfal (ACM Trans. Knowl. Discov. Data, 2021)

The DAG Visit Approach for Pebbling and I/O Lower Bounds. - Gianfranco Bilardi; Lorenzo De Stefani (FSTTCS, 2022)

Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms. - Lorenzo De Stefani (SPAA, 2022)

On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms. - Lorenzo De Stefani; Vedant Gupta (CoRR, 2024)

A universal bound on the space complexity of Directed Acyclic Graph computations. - Gianfranco Bilardi; Lorenzo De Stefani (CoRR, 2024)

On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming Algorithms. - Lorenzo De Stefani; Vedant Gupta (WADS, 2025)