Lorenzo De Stefani

33 papers A* 3A 1B 6Journal 17Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
A universal bound on the space complexity of directed acyclic graph computations.
Inf. Process. Lett.
Gianfranco Bilardi, Lorenzo De Stefani
2025 B conf
On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming Algorithms.
WADS
Lorenzo De Stefani, Vedant Gupta
2024 J jnl
A universal bound on the space complexity of Directed Acyclic Graph computations.
CoRR
Gianfranco Bilardi, Lorenzo De Stefani
2024 J jnl
On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms.
CoRR
Lorenzo De Stefani, Vedant Gupta
2022 B conf
Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms.
SPAA
Lorenzo De Stefani
2022 — conf
The DAG Visit Approach for Pebbling and I/O Lower Bounds.
FSTTCS
Gianfranco Bilardi, Lorenzo De Stefani
2022 J jnl
The DAG Visit approach for Pebbling and I/O Lower Bounds.
CoRR
Gianfranco Bilardi, Lorenzo De Stefani
2021 J jnl
Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams.
ACM Trans. Knowl. Discov. Data
Lorenzo De Stefani, Erisa Terolli, Eli Upfal
2020 J jnl
Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model.
CoRR
Lorenzo De Stefani
2020 — —
Probabilistic approaches for rigorous and efficient analysis of statistical properties of large datasets.
Lorenzo De Stefani
2019 J jnl
A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis.
CoRR
Lorenzo De Stefani, Eli Upfal
2019 B conf
A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis.
DSAA
Lorenzo De Stefani, Eli Upfal
2019 J jnl
On the I/O complexity of hybrid algorithms for Integer Multiplication.
CoRR
Lorenzo De Stefani
2019 B conf
The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication.
ISAAC
Lorenzo De Stefani
2019 A* conf
The I/O complexity of Toom-Cook integer multiplication.
SODA
Gianfranco Bilardi, Lorenzo De Stefani
2019 J jnl
The I/O complexity of hybrid algorithms for square matrix multiplication.
CoRR
Lorenzo De Stefani
2019 B conf
VizCertify: A Framework for Secure Visual Data Exploration.
DSAA
Lorenzo De Stefani, Leonhard F. Spiegelberg, Eli Upfal, Tim Kraska
2018 J jnl
VizRec: A framework for secure data exploration via visual representation.
CoRR
Lorenzo De Stefani, Leonhard F. Spiegelberg, Tim Kraska, Eli Upfal
2017 — conf
Controlling False Discoveries During Interactive Data Exploration.
SIGMOD Conference
Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska
2017 — conf
Safe Visual Data Exploration.
SIGMOD Conference
Zheguang Zhao, Emanuel Zgraggen, Lorenzo De Stefani, Carsten Binnig, Eli Upfal, Tim Kraska
2017 J jnl
TRIÈST: Counting Local and Global Triangles in Fully Dynamic Streams with Fixed Memory Size.
ACM Trans. Knowl. Discov. Data
Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
2017 B conf
The I/O Complexity of Strassen's Matrix Multiplication with Recomputation.
WADS
Gianfranco Bilardi, Lorenzo De Stefani
2017 J jnl
Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams.
CoRR
Lorenzo De Stefani, Erisa Terolli, Eli Upfal
2017 — conf
Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams.
IEEE BigData
Lorenzo De Stefani, Erisa Terolli, Eli Upfal
2017 A conf
Toward Sustainable Insights, or Why Polygamy is Bad for You.
CIDR
Carsten Binnig, Lorenzo De Stefani, Tim Kraska, Eli Upfal, Emanuel Zgraggen, Zheguang Zhao
2016 J jnl
Controlling False Discoveries During Interactive Data Exploration.
CoRR
Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska
2016 A* conf
Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic.
AAAI
Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin
2016 A* conf
TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size.
KDD
Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
2016 J jnl
TRIÈST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size.
CoRR
Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal
2016 J jnl
The I/O complexity of Strassen's matrix multiplication with recomputation.
CoRR
Gianfranco Bilardi, Lorenzo De Stefani
2015 J jnl
Exploiting non-constant safe memory in resilient algorithms and data structures.
Theor. Comput. Sci.
Lorenzo De Stefani, Francesco Silvestri
2013 J jnl
Exploiting non-constant safe memory in resilient algorithms and data structures
CoRR
Lorenzo De Stefani, Francesco Silvestri
2009 — conf
A Visualization Tool of Probabilistic Models for Information Access Components.
ECDL
Lorenzo De Stefani, Giorgio Maria Di Nunzio, Giorgio Vezzaro