Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization. - Lucas Slot; Monique Laurent (Math. Program., 2021)

Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets. - Lucas Slot; Monique Laurent (Math. Program., 2022)

Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel-Darboux Kernel. - Lucas Slot (SIAM J. Optim., 2022)

The Christoffel-Darboux Kernel for Topological Data Analysis. - Pepijn Roos Hoefgeest; Lucas Slot (SoCG, 2023)

A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. - Sander Gribling; Sven C. Polak; Lucas Slot (ISSAC, 2023)

Sum-of-squares hierarchies for binary polynomial optimization. - Lucas Slot; Monique Laurent (Math. Program., 2023)

An effective version of Schmüdgen's Positivstellensatz for the hypercube. - Monique Laurent; Lucas Slot (Optim. Lett., 2023)

A Recursive Theta Body for Hypergraphs. - Davi Castro-Silva; Fernando Mário de Oliveira Filho; Lucas Slot; Frank Vallentin (Comb., 2023)

Testably Learning Polynomial Threshold Functions. - Lucas Slot; Stefan Tiegel; Manuel Wiedmer (NeurIPS, 2024)

Degree Bounds for Putinar's Positivstellensatz on the Hypercube. - Lorenzo Baldi; Lucas Slot (SIAM J. Appl. Algebra Geom., 2024)

Computational complexity of sum-of-squares bounds for copositive programs. - Marilena Palomba; Lucas Slot; Luis Felipe Vargas; Monaldo Mastrolilli (CoRR, 2025)

Low degree conjecture implies sharp computational thresholds in stochastic block model. - Jingqiu Ding; Yiding Hua; Lucas Slot; David Steurer (CoRR, 2025)