معرفی
Duri Andrea Janett is a PhD Fellow in the Department of Computer Science at the University of Copenhagen and Lund University, affiliated with the Algorithms and Complexity research section and the MIAO research group. She is supervised by Professor Jakob Nordström and focuses on theoretical aspects of computer science.
Her primary research interests center on computational complexity theory, with specialization in proof complexity. She investigates fundamental limits of proof systems including resolution, cutting planes, and monotone circuits, while also exploring connections to combinatorial algorithms and evolutionary computation. Her work bridges theoretical computer science with practical algorithmic analysis.
Janett's recent publications demonstrate strong trends in theoretical runtime analysis of evolutionary algorithms and supercritical trade-offs in proof systems. Her 2025 STOC paper establishes foundational limits for multiple proof systems simultaneously, while her 2024 Algorithmica paper provides tight runtime bounds for evolutionary algorithms on linear functions. These works collectively advance understanding of computational barriers in both proof complexity and evolutionary computation.
As a core member of the MIAO research group, she actively participates in theoretical computer science collaborations across Nordic institutions. Her research methodology combines rigorous mathematical analysis with computational experiments to derive theoretical guarantees for complex algorithmic behaviors.
