default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorenzo Beretta 0001
Person information
- affiliation: University of Copenhagen, Denmark
Other persons with the same name
- Lorenzo Beretta 0002 — Referral Center for Systemic Autoimmune Diseases, Fondazione IRCCS Ca'Granda Ospedale Maggiore Policlinico, Milan, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Lorenzo Beretta
, Jakub Tetek:
Better Sum Estimation via Weighted Sampling. ACM Trans. Algorithms 20(3): 27 (2024)- [c8]Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma:
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. ESA 2024: 5:1-5:15 - [c7]Lorenzo Beretta, Aviad Rubinstein:
Approximate Earth Mover's Distance in Truly-Subquadratic Time. STOC 2024: 47-58 - [i9]Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, László Kozma:
Online sorting and online TSP: randomized, stochastic, and high-dimensional. CoRR abs/2406.19257 (2024) - [i8]Marco Miani, Lorenzo Beretta, Søren Hauberg:
Sketched Lanczos uncertainty score: a low-memory summary of the Fisher information. CoRR abs/2409.15008 (2024) - 2023
- [j1]Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini:
An Optimal Algorithm for Finding Champions in Tournament Graphs. IEEE Trans. Knowl. Data Eng. 35(10): 10197-10209 (2023) - [c6]Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup:
Locally Uniform Hashing. FOCS 2023: 1440-1470 - [c5]Lorenzo Beretta, Vincent Cohen-Addad, Silvio Lattanzi, Nikos Parotsidis:
Multi-Swap k-Means++. NeurIPS 2023 - [c4]Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist:
Online Sorting and Translational Packing of Convex Polygons. SODA 2023: 1806-1833 - [i7]Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup:
Locally Uniform Hashing. CoRR abs/2308.14134 (2023) - [i6]Lorenzo Beretta, Vincent Cohen-Addad, Silvio Lattanzi, Nikos Parotsidis:
Multi-Swap k-Means++. CoRR abs/2309.16384 (2023) - [i5]Lorenzo Beretta, Aviad Rubinstein:
Approximate Earth Mover's Distance in Truly-Subquadratic Time. CoRR abs/2310.19514 (2023) - 2022
- [c3]Lorenzo Beretta, Jakub Tetek:
Better Sum Estimation via Weighted Sampling. SODA 2022: 2303-2338 - 2021
- [c2]Mikkel Abrahamsen, Lorenzo Beretta:
Online Packing to Minimize Area or Perimeter. SoCG 2021: 6:1-6:15 - [i4]Mikkel Abrahamsen, Lorenzo Beretta:
Online Packing to Minimize Area or Perimeter. CoRR abs/2101.09024 (2021) - [i3]Lorenzo Beretta, Jakub Tetek:
Better Sum Estimation via Weighted Sampling. CoRR abs/2110.14948 (2021) - [i2]Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini:
An Optimal Algorithm for Finding Champions in Tournament Graphs. CoRR abs/2111.13621 (2021) - [i1]Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist:
Online Sorting and Translational Packing of Convex Polygons. CoRR abs/2112.03791 (2021)
2010 – 2019
- 2019
- [c1]Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini:
An Optimal Algorithm to Find Champions of Tournament Graphs. SPIRE 2019: 267-273
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 2024-10-23 20:32 CEST 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:
