default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorenzo De Stefani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Lorenzo De Stefani, Vedant Gupta:
On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms. CoRR abs/2410.20337 (2024)- [i12]Gianfranco Bilardi, Lorenzo De Stefani:
A universal bound on the space complexity of Directed Acyclic Graph computations. CoRR abs/2410.20547 (2024) - 2022
- [c14]Gianfranco Bilardi, Lorenzo De Stefani:
The DAG Visit Approach for Pebbling and I/O Lower Bounds. FSTTCS 2022: 7:1-7:23 - [c13]Lorenzo De Stefani:
Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms. SPAA 2022: 449-452 - [i11]Gianfranco Bilardi, Lorenzo De Stefani:
The DAG Visit approach for Pebbling and I/O Lower Bounds. CoRR abs/2210.01897 (2022) - 2021
- [j3]Lorenzo De Stefani, Erisa Terolli, Eli Upfal:
Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams. ACM Trans. Knowl. Discov. Data 15(5): 79:1-79:52 (2021) - 2020
- [i10]Lorenzo De Stefani:
Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model. CoRR abs/2009.14590 (2020)
2010 – 2019
- 2019
- [c12]Lorenzo De Stefani, Eli Upfal:
A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis. DSAA 2019: 71-80 - [c11]Lorenzo De Stefani, Leonhard F. Spiegelberg, Eli Upfal, Tim Kraska:
VizCertify: A Framework for Secure Visual Data Exploration. DSAA 2019: 241-251 - [c10]Lorenzo De Stefani:
The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication. ISAAC 2019: 33:1-33:16 - [c9]Gianfranco Bilardi, Lorenzo De Stefani:
The I/O complexity of Toom-Cook integer multiplication. SODA 2019: 2034-2052 - [i9]Lorenzo De Stefani:
The I/O complexity of hybrid algorithms for square matrix multiplication. CoRR abs/1904.12804 (2019) - [i8]Lorenzo De Stefani, Eli Upfal:
A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis. CoRR abs/1910.03493 (2019) - [i7]Lorenzo De Stefani:
On the I/O complexity of hybrid algorithms for Integer Multiplication. CoRR abs/1912.08045 (2019) - 2018
- [i6]Lorenzo De Stefani, Leonhard F. Spiegelberg, Tim Kraska, Eli Upfal:
VizRec: A framework for secure data exploration via visual representation. CoRR abs/1811.00602 (2018) - 2017
- [j2]Lorenzo De Stefani, Alessandro Epasto
, Matteo Riondato, Eli Upfal:
TRIÈST: Counting Local and Global Triangles in Fully Dynamic Streams with Fixed Memory Size. ACM Trans. Knowl. Discov. Data 11(4): 43:1-43:50 (2017) - [c8]Lorenzo De Stefani, Erisa Terolli, Eli Upfal:
Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams. IEEE BigData 2017: 776-786 - [c7]Carsten Binnig, Lorenzo De Stefani, Tim Kraska, Eli Upfal, Emanuel Zgraggen, Zheguang Zhao:
Toward Sustainable Insights, or Why Polygamy is Bad for You. CIDR 2017 - [c6]Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska:
Controlling False Discoveries During Interactive Data Exploration. SIGMOD Conference 2017: 527-540 - [c5]Zheguang Zhao, Emanuel Zgraggen, Lorenzo De Stefani, Carsten Binnig, Eli Upfal, Tim Kraska:
Safe Visual Data Exploration. SIGMOD Conference 2017: 1671-1674 - [c4]Gianfranco Bilardi, Lorenzo De Stefani:
The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. WADS 2017: 181-192 - [i5]Lorenzo De Stefani, Erisa Terolli, Eli Upfal:
Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams. CoRR abs/1710.02108 (2017) - 2016
- [c3]Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin:
Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic. AAAI 2016: 1526-1532 - [c2]Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal:
TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. KDD 2016: 825-834 - [i4]Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal:
TRIÈST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size. CoRR abs/1602.07424 (2016) - [i3]Gianfranco Bilardi, Lorenzo De Stefani:
The I/O complexity of Strassen's matrix multiplication with recomputation. CoRR abs/1605.02224 (2016) - [i2]Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska:
Controlling False Discoveries During Interactive Data Exploration. CoRR abs/1612.01040 (2016) - 2015
- [j1]Lorenzo De Stefani, Francesco Silvestri:
Exploiting non-constant safe memory in resilient algorithms and data structures. Theor. Comput. Sci. 583: 86-97 (2015) - 2013
- [i1]Lorenzo De Stefani, Francesco Silvestri:
Exploiting non-constant safe memory in resilient algorithms and data structures. CoRR abs/1305.3828 (2013)
2000 – 2009
- 2009
- [c1]Lorenzo De Stefani, Giorgio Maria Di Nunzio, Giorgio Vezzaro:
A Visualization Tool of Probabilistic Models for Information Access Components. ECDL 2009: 481-482
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
