Scholar
Kilian Risse
Google Scholar ID: WUaD4S0AAAAJ
postdoc at LTH
Citations & Impact
Citations
30
H-index
4
i10-index
0
Publications
9
Co-authors
10
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Supercritical Tradeoffs for Monotone Circuits, with Mika Göös, Gilbert Maystre, and Dmitry Sokolov, STOC 2025.
- Clique Is Hard on Average for Unary Sherali-Adams, with Susanna de Rezende and Aaron Potechin, FOCS 2023.
- Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz, with Jonas Conneryd, Susanna de Rezende, Jakob Nordström, and Shuo Pang, FOCS 2023.
- Sum of Squares Lower Bounds for the Minimum Circuit Size Problem, with Per Austrin, CCC 2023.
- On bounded depth proofs for Tseitin formulas on the grid; revisited, with Johan Håstad, FOCS 2022, SICOMP.
- Perfect Matching in Random Graphs is as Hard as Tseitin, with Per Austrin, SODA 2022, TheoretiCS.
- Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs, with Susanna de Rezende, Jakob Nordström, and Dmitry Sokolov, CCC 2020, TheoretiCS.
Research Experience
- Postdoc at EPFL, hosted by Ola Svensson; currently a postdoctoral researcher at LTH, Lund University, hosted by Susanna de Rezende.
Education
- PhD from KTH Royal Institute of Technology in Sweden, under the joint supervision of Per Austrin, Johan Håstad, and Jakob Nordström.
Background
- He is a postdoctoral researcher at LTH, Lund University, hosted by Susanna de Rezende. Prior to this, he was a postdoc at EPFL, hosted by Ola Svensson. His research interests include complexity theory and proof complexity.
Miscellany
- His CV can be found here, and you can reach him by email at rissekil at gmail dot com.
