default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucas Slot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j7]Lorenzo Baldi
, Lucas Slot:
Degree Bounds for Putinar's Positivstellensatz on the Hypercube. SIAM J. Appl. Algebra Geom. 8(1): 1-25 (2024)- 2023
- [j6]Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot, Frank Vallentin:
A Recursive Theta Body for Hypergraphs. Comb. 43(5): 909-938 (2023) - [j5]Lucas Slot, Monique Laurent:
Sum-of-squares hierarchies for binary polynomial optimization. Math. Program. 197(2): 621-660 (2023) - [j4]Monique Laurent, Lucas Slot:
An effective version of Schmüdgen's Positivstellensatz for the hypercube. Optim. Lett. 17(3): 515-530 (2023) - 2022
- [j3]Lucas Slot, Monique Laurent:
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets. Math. Program. 193(2): 831-871 (2022) - [j2]Lucas Slot:
Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel-Darboux Kernel. SIAM J. Optim. 32(4): 2612-2635 (2022) - 2021
- [j1]Lucas Slot, Monique Laurent:
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization. Math. Program. 188(2): 443-460 (2021)
Conference and Workshop Papers
- 2024
- [c4]Lucas Slot, Stefan Tiegel, Manuel Wiedmer:
Testably Learning Polynomial Threshold Functions. NeurIPS 2024 - 2023
- [c3]Pepijn Roos Hoefgeest, Lucas Slot:
The Christoffel-Darboux Kernel for Topological Data Analysis. SoCG 2023: 38:1-38:20 - [c2]Sander Gribling, Sven C. Polak, Lucas Slot:
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. ISSAC 2023: 280-288 - 2021
- [c1]Lucas Slot, Monique Laurent:
Sum-of-Squares Hierarchies for Binary Polynomial Optimization. IPCO 2021: 43-57
Informal and Other Publications
- 2024
- [i3]Lucas Slot, Stefan Tiegel, Manuel Wiedmer:
Testably Learning Polynomial Threshold Functions. CoRR abs/2406.06106 (2024) - 2023
- [i2]Sander Gribling, Sven C. Polak, Lucas Slot:
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. CoRR abs/2305.14944 (2023) - 2022
- [i1]Pepijn Roos Hoefgeest, Lucas Slot:
The Christoffel-Darboux kernel for topological data analysis. CoRR abs/2211.15489 (2022)
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-02-15 01:16 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:
