default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKilian Risse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[i15]Susanna F. de Rezende, David Engström, Yassine Ghannane, Kilian Risse:
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size. CoRR abs/2604.28172 (2026)- [i14]Alexandros Hollender, Gilbert Maystre, Kilian Risse:
On Cutting Cakes and Crossing Curves. CoRR abs/2606.13980 (2026) - [i13]Susanna F. de Rezende, David Engström, Yassine Ghannane, Kilian Risse:
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size. Electron. Colloquium Comput. Complex. TR26: Article TR26-078 (2026) - 2025
- [j3]Johan Håstad, Kilian Risse
:
On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited. SIAM J. Comput. 54(5): S22-288 (2025) - [j2]Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. TheoretiCS 4: Article 9 (2025) - [c7]Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov:
Supercritical Tradeoffs for Monotone Circuits. STOC 2025: 1359-1370 - [i12]Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse:
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. CoRR abs/2503.17022 (2025) - [i11]Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse:
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. Electron. Colloquium Comput. Complex. TR25: Article TR25-032 (2025) - 2024
- [i10]Susanna F. de Rezende, Aaron Potechin, Kilian Risse:
Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients. CoRR abs/2404.16722 (2024) - [i9]Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov:
Supercritical Tradeoffs for Monotone Circuits. CoRR abs/2411.14268 (2024) - [i8]Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov:
Supercritical Tradeoffs for Monotone Circuits. Electron. Colloquium Comput. Complex. TR24: Article TR24-186 (2024) - 2023
- [c6]Per Austrin, Kilian Risse:
Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem. CCC 2023: 31:1-31:21 - [c5]Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse:
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. FOCS 2023: 1-11 - [c4]Susanna F. de Rezende, Aaron Potechin, Kilian Risse:
Clique Is Hard on Average for Unary Sherali-Adams. FOCS 2023: 12-25 - [i7]Per Austrin, Kilian Risse:
Sum-of-Squares Lower Bounds for the Minimum Circuit Size Problem. CoRR abs/2311.12994 (2023) - [i6]Per Austrin, Kilian Risse:
Sum-of-Squares Lower Bounds for the Minimum Circuit Size Problem. Electron. Colloquium Comput. Complex. TR23: Article TR23-010 (2023) - 2022
- [j1]Per Austrin, Kilian Risse:
Perfect Matching in Random Graphs is as Hard as Tseitin. TheoretiCS 1: Article 2 (2022) - [c3]Johan Håstad, Kilian Risse:
On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited. FOCS 2022: 1138-1149 - [c2]Per Austrin, Kilian Risse:
Perfect Matching in Random Graphs is as Hard as Tseitin. SODA 2022: 979-1012 - [i5]Per Austrin, Kilian Risse:
Perfect Matching in Random Graphs is as Hard as Tseitin. CoRR abs/2201.10835 (2022) - [i4]Johan Håstad, Kilian Risse:
On bounded depth proofs for Tseitin formulas on the grid; revisited. CoRR abs/2209.05839 (2022) - 2021
- [i3]Per Austrin, Kilian Risse:
Average-Case Perfect Matching Lower Bounds from Hardness of Tseitin Formulas. Electron. Colloquium Comput. Complex. TR21: Article TR21-021 (2021) - 2020
- [c1]Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CCC 2020: 28:1-28:24
2010 – 2019
- 2019
- [i2]Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CoRR abs/1912.00534 (2019) - [i1]Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. Electron. Colloquium Comput. Complex. TR19: Article TR19-174 (2019)
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-10-10 20:52 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
