Skip to main content
To KTH's start page

Division of Theoretical Computer Science

The Division of Theoretical Computer Science (TCS) works on the foundations of efficient and correct algorithms and software, and it deals with the tractability of computational problems. Applications areas include software engineering, computer security and privacy, cryptography, verification and sat solving, natural language tools, and computer science education 

Research areas

Algorithms and Complexity research

Algorithms and Complexity

Solving a computational problem requires resources and the fundamental question studied in this research area is to determine, as closely as possible, the computational difficulty of basic problems.

computer security research

Computer security

We study the impact of network communication delays and failures on the behavior of networked software, where error handling is difficult to test with conventional means.

Computer Science education research

Computer science education

Computer science education research is an interdisciplinary area aiming at improving the understanding of how students learn computer science and how the teaching and assessment of computer science could be improved.

Foundations of data science research

Foundations of Data Science

Data science has emerged as a key discipline to enable transforming the available data into knowledge products that bring insights into the corresponding domains, improve decision making, and accelerate scientific discovery.

Software construction and analysis research

Software construction and analysis

A major current technological and societal challenge is to be able to produce software systems that behave in a reliable and predictable manner. We perform research into different ways of mastering software complexity.

Meet the division

Recent publications

[1]
D. J. Bouvier et al., "GenAI Integration in Upper-Level Computing Courses," in ITiCSE 2025 - Proceedings of the 30th ACM Conference on Innovation and Technology in Computer Science Education, 2025, pp. 691-692.
[2]
J. Blikstad et al., "Global vs. s-t Vertex Connectivity Beyond Sequential : Almost-Perfect Reductions and Near-Optimal Separations," in STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, pp. 2305-2316.
[3]
P. Austrin et al., "Algorithms for the Diverse-k-SAT Problem : The Geometry of Satisfying Assignments," in 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, 2025.
Full list in the KTH publications portal

News

Martin Monperrus

AI fixes security flaws – KTH wins prestigious award

Can AI fix security flaws before hackers strike? KTH researchers say yes—and their breakthrough won the Best Paper Award 2023 from IEEE Transactions on Software Engineering. By using AI to automate se...

Read the article
Samuel Lavebrink and Madeleine Lindström are studying the Master's programme Machine Learning.

How to stop cyber-attacks with honeypots

In the ever-evolving landscape of cyber warfare, defending against human-controlled cyberattacks requires innovative strategies. A recent study conducted by students at KTH delves into the realm of cy...

Read the article

Cyrille Artho new director of CASTOR

Cyrille Artho is the new Director of the CASTOR Software research centre. He’s lived in Japan for 11 years, where he worked on analysing networked software and testing together with software security....

Read the article

Calendar