| 2026 | SODA | New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. | Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivn |
| 2026 | SODA | On the Quantum Chromatic Gap. | Lorenzo Ciardo |
| 2025 | LICS | Classical Simulation of Quantum CSP Strategies. | Demian Banakh, Lorenzo Ciardo, Marcin Kozik, Jan Tulowiecki |
| 2024 | LICS | Quantum advantage and CSP complexity. | Lorenzo Ciardo |
| 2024 | LICS | 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. | Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivn |
| 2024 | STOC | Semidefinite Programming and Linear Equations vs. Homomorphism Problems. | Lorenzo Ciardo, Stanislav Zivn |
| 2023 | SODA | Hierarchies of Minion Tests for PCSPs through Tensors. | Lorenzo Ciardo, Stanislav Zivn |
| 2023 | SODA | Approximate Graph Colouring and Crystals. | Lorenzo Ciardo, Stanislav Zivn |
| 2023 | STOC | Approximate Graph Colouring and the Hollow Shadow. | Lorenzo Ciardo, Stanislav Zivn |
| 2022 | SODA | CLAP: A New Algorithm for Promise CSPs. | Lorenzo Ciardo, Stanislav Zivn |