Lorenzo De Stefani

According to our database, Lorenzo De Stefani authored at least 23 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

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

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

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 CYK Algorithm and of a Family of Related DP Algorithms.

Lorenzo De Stefani, Vedant Gupta

CoRR, 2024

2022

Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms.

Lorenzo De Stefani

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

The DAG Visit Approach for Pebbling and I/O Lower Bounds.

Gianfranco Bilardi, Lorenzo De Stefani

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

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

2020

Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model.

Lorenzo De Stefani

CoRR, 2020

2019

On the I/O complexity of hybrid algorithms for Integer Multiplication.

Lorenzo De Stefani

CoRR, 2019

A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis.

Lorenzo De Stefani, Eli Upfal

CoRR, 2019

The I/O complexity of Toom-Cook integer multiplication.

Gianfranco Bilardi, Lorenzo De Stefani

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication.

Lorenzo De Stefani

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis.

Lorenzo De Stefani, Eli Upfal

Proceedings of the 2019 IEEE International Conference on Data Science and Advanced Analytics, 2019

VizCertify: A Framework for Secure Visual Data Exploration.

Lorenzo De Stefani, Leonhard F. Spiegelberg, Eli Upfal, Tim Kraska

Proceedings of the 2019 IEEE International Conference on Data Science and Advanced Analytics, 2019

2018

VizRec: A framework for secure data exploration via visual representation.

Lorenzo De Stefani, Leonhard F. Spiegelberg, Tim Kraska, Eli Upfal

CoRR, 2018

2017

The I/O Complexity of Strassen's Matrix Multiplication with Recomputation.

Gianfranco Bilardi, Lorenzo De Stefani

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Safe Visual Data Exploration.

Zheguang Zhao, Emanuel Zgraggen, Lorenzo De Stefani, Carsten Binnig, Eli Upfal, Tim Kraska

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Controlling False Discoveries During Interactive Data Exploration.

Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Toward Sustainable Insights, or Why Polygamy is Bad for You.

Carsten Binnig, Lorenzo De Stefani, Tim Kraska, Eli Upfal, Emanuel Zgraggen, Zheguang Zhao

Proceedings of the 8th Biennial Conference on Innovative Data Systems Research, 2017

Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams.

Lorenzo De Stefani, Erisa Terolli, Eli Upfal

Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

2016

TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size.

Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal

Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

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

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

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Exploiting non-constant safe memory in resilient algorithms and data structures.

Lorenzo De Stefani, Francesco Silvestri

Theor. Comput. Sci., 2015

2009

A Visualization Tool of Probabilistic Models for Information Access Components.

Lorenzo De Stefani, Giorgio Maria Di Nunzio, Giorgio Vezzaro

Proceedings of the Research and Advanced Technology for Digital Libraries, 2009