Lorenzo De Stefani

According to our database1, Lorenzo De Stefani authored at least 20 papers between 2009 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms.
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.
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.
ACM Trans. Knowl. Discov. Data, 2021

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

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

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

The I/O complexity of Toom-Cook integer multiplication.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication.
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.
Proceedings of the 2019 IEEE International Conference on Data Science and Advanced Analytics, 2019

VizCertify: A Framework for Secure Visual Data Exploration.
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.
CoRR, 2018

2017
TRIÈST: Counting Local and Global Triangles in Fully Dynamic Streams with Fixed Memory Size.
ACM Trans. Knowl. Discov. Data, 2017

The I/O Complexity of Strassen's Matrix Multiplication with Recomputation.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Safe Visual Data Exploration.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Controlling False Discoveries During Interactive Data Exploration.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Toward Sustainable Insights, or Why Polygamy is Bad for You.
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.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

2016
Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Exploiting non-constant safe memory in resilient algorithms and data structures.
Theor. Comput. Sci., 2015

2009
A Visualization Tool of Probabilistic Models for Information Access Components.
Proceedings of the Research and Advanced Technology for Digital Libraries, 2009


  Loading...