avatar

Duri Andrea Janett

PhD Student
University of Copenhagen
duja at-sign di dot ku dot dk


About Me

I am a third year PhD student at the University of Copenhagen, advised by Jakob Nordström. I am a member of the MIAO group.
My interests are in computational complexity theory, and in particular proof complexity.
Before coming to Copenhagen, I received a Bachelor’s and Master’s degree in mathematics from ETH Zürich, where I was advised by Carola Doerr and Johannes Lengler.

Publications

  1. Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
    Susanna F. de Rezende, David Engström, Yassine Ghannane, Duri Andrea Janett, and Artur Riazanov
    Proceedings of the 53rd EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2026), to appear.

  2. Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler–Leman
    Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström and Shuo Pang
    Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC 2025).
    arxiv ECCC Conference MIAO Seminar

  3. Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
    Carola Doerr, Duri Andrea Janett and Johannes Lengler
    Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2023).
    Algorithmica (2024) 86:3115-3152.
    arxiv Conference Journal

  4. Two-Dimensional Drift Analysis: Optimizing Two Functions Simultaneously Can Be Hard
    Duri Janett and Johannes Lengler
    Proceedings of the International Conference on Parallel Problem Solving from Nature (PPSN 2022).
    Best Paper Nomination
    Theoretical Computer Science 971 (2023) 114072.
    arxiv Conference Journal


Last update: April 20, 2026.
Powered by Jekyll and Minimal Light theme.