default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorenzo Ciardo
Person information
- affiliation: TU Graz, Austria
- affiliation (former): University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j5]Lorenzo Ciardo
:
Quantum advantage and CSP complexity. J. Comb. Theory B 176: 404-439 (2026)- [c10]Lorenzo Ciardo:
On the Quantum Chromatic Gap. SODA 2026: 3364-3377 - [c9]Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivný:
New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. SODA 2026: 3965-3977 - [i13]Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivný:
New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. CoRR abs/2602.10368 (2026) - 2025
- [j4]Lorenzo Ciardo, Stanislav Zivný:
Semidefinite Programming and Linear Equations vs. Homomorphism Problems. SIAM J. Comput. 54(3): 545-584 (2025) - [j3]Lorenzo Ciardo, Stanislav Zivný:
Approximate Graph Coloring and the Crystal with a Hollow Shadow. SIAM J. Comput. 54(4): 1138-1192 (2025) - [j2]Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný:
1-in-3 vs. Not-All-Equal: Dichotomy of a Broken Promise. ACM Trans. Comput. Log. 26(2): 10:1-10:22 (2025) - [c8]Demian Banakh, Lorenzo Ciardo, Marcin Kozik, Jan Tulowiecki:
Classical Simulation of Quantum CSP Strategies. LICS 2025: 372-388 - [i12]Demian Banakh, Lorenzo Ciardo, Marcin Kozik, Jan Tulowiecki:
Classical Simulation of Quantum CSP Strategies. CoRR abs/2503.23206 (2025) - [i11]Lorenzo Ciardo:
On the Quantum Chromatic Gap. CoRR abs/2503.23207 (2025) - [i10]Lorenzo Ciardo, Gideo Joubert, Antoine Mottet:
Quantum Polymorphisms and Commutativity Gadgets. CoRR abs/2511.23445 (2025) - 2024
- [c7]Lorenzo Ciardo:
Quantum advantage and CSP complexity. LICS 2024: 23:1-23:15 - [c6]Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný:
1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. LICS 2024: 24:1-24:12 - [c5]Lorenzo Ciardo, Stanislav Zivný:
Semidefinite Programming and Linear Equations vs. Homomorphism Problems. STOC 2024: 1935-1943 - [i9]Lorenzo Ciardo:
Quantum Advantage and CSP Complexity. CoRR abs/2404.13186 (2024) - [i8]Lorenzo Ciardo, Stanislav Zivný:
The periodic structure of local consistency. CoRR abs/2406.19685 (2024) - 2023
- [j1]Lorenzo Ciardo, Stanislav Zivný:
CLAP: A New Algorithm for Promise CSPs. SIAM J. Comput. 52(1): 1-37 (2023) - [c4]Lorenzo Ciardo, Stanislav Zivný:
Hierarchies of Minion Tests for PCSPs through Tensors. SODA 2023: 568-580 - [c3]Lorenzo Ciardo, Stanislav Zivný:
Approximate Graph Colouring and Crystals. SODA 2023: 2256-2267 - [c2]Lorenzo Ciardo, Stanislav Zivný:
Approximate Graph Colouring and the Hollow Shadow. STOC 2023: 623-631 - [i7]Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný:
On the complexity of the approximate hypergraph homomorphism problem. CoRR abs/2302.03456 (2023) - [i6]Lorenzo Ciardo, Stanislav Zivný:
Semidefinite programming and linear equations vs. homomorphism problems. CoRR abs/2311.00882 (2023) - 2022
- [c1]Lorenzo Ciardo, Stanislav Zivný:
CLAP: A New Algorithm for Promise CSPs. SODA 2022: 1057-1068 - [i5]Lorenzo Ciardo, Stanislav Zivný:
The Sherali-Adams Hierarchy for Promise CSPs through Tensors. CoRR abs/2203.02478 (2022) - [i4]Lorenzo Ciardo, Stanislav Zivný:
Hierarchies of Minion Tests for PCSPs through Tensors. CoRR abs/2207.02277 (2022) - [i3]Lorenzo Ciardo, Stanislav Zivný:
Approximate Graph Colouring and Crystals. CoRR abs/2210.08293 (2022) - [i2]Lorenzo Ciardo, Stanislav Zivný:
Approximate Graph Colouring and the Hollow Shadow. CoRR abs/2211.03168 (2022) - 2021
- [i1]Lorenzo Ciardo, Stanislav Zivný:
CLAP: A New Algorithm for Promise CSPs. CoRR abs/2107.05018 (2021)
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 2026-03-27 00:15 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:
