Department of Computer Science

Algorithms and Theoretical Computer Science

Fundamental methods and mathematics of computation.
Algorithms and theoretical computer science, illustration Matti Ahlgren/Aalto University

Theoretical computer science studies the fundamental methods and mathematics of computation: the design of efficient algorithms, models and frameworks for computing, and the resource requirements of computational tasks.

Research topics: algebraic algorithms, approximation algorithms, combinatorial optimization, cryptography, Security & Complexity, distributed and parallel computing, natural computation, parameterized algorithms.

For more information on our research, please see the homepage of Theoretical Computer Science group.

Aalto CS Theory Seminar

The seminar is a weekly series of talks on a broad scope of CS theory hosted by the Aalto CS Theory Group.

Read more
Laptop computer keyboard detail / photo: Aalto University, Matti Ahlgren
Professor Paler infront of the Comptuer Science department

Alexandru Paler: Creating software for quantum computers

The newest professor to join the department of computer science tells us about how, when you cut through all the hype, quantum computing is full of interesting challenges that unites diverse fields

News
Piirroskuva ihmisestä digimaailmassa, piirros: Sanni Wessman

The builders of digital trust

A society gone online needs encrypters, white hats and appropriately suspicious citizens.

News
Jara Uitto sitting at Computer Science building, looking at the camera and wearing an orange t-shirt with a panda on it

Many practical issues are related to questions of theory – this steered Jara Uitto’s interest towards theoretical computer science

Even though theoretical computer science is – as its name suggests – theoretical, its connection to real-life questions is easy to draw, says Assistant Professor Jara Uitto.

News
Jukka Suomela Research Group

Aalto researchers awarded for an article showing that algorithms cannot match more effectively than they do now

Any method designed to find a matching is either slow or leads to a wrong solution

News
Voronoi Mona Lisa

Researchers at Aalto and Karolinska developed a microscope without a microscope

DNA microscopy makes it possible to view biological molecules on micro-level without expensive optics.

News
Jussi Rintanen

Jussi Rintanen knows how to find the right option from among the countless possibilities

Algorithm-based artificial intelligence can help optimise bus routes, factories and work shift lists. It can also be used to automate the much of current software development.

News

Latest publications

The fine-grained complexity of computing the Tutte polynomial of a linear matroid

Andreas Björklund, Petteri Kaski 2021 Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)

Coresets for Clustering in Excluded-minor Graphs and Beyond

Vladimir Braverman, Shaofeng Jiang, Robert Krauthgamer, Xuan Wu 2021 Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms

Coloring and maximum weight independent set of rectangles

Parinya Chalermsook, Bartosz Walczak 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021

Vertex sparsification for edge connectivity

Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021

Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity

Max Franck, Sorrachai Yingchareonthawornchai 2021 19th International Symposium on Experimental Algorithms, SEA 2021

Vertex Connectivity in Poly-Logarithmic Max-Flows

Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai 2021 Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

Efficient Load-Balancing through Distributed Token Dropping

Jara Uitto, Jukka Suomela, Barbara Keller, Sebastian Brandt, Joel Rybicki 2021 ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

Brief Announcement: Classification of Distributed Binary Labeling Problems

Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela 2020 PODC 2020 - Proceedings of the 39th Symposium on Principles of Distributed Computing

Classification of Distributed Binary Labeling Problems

Alkida Balliu, Brandt Sebastian, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela 2020 34th International Symposium on Distributed Computing (DISC 2020)

How much does randomness help with locally checkable problems?

Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela 2020 PODC 2020 - Proceedings of the 39th Symposium on Principles of Distributed Computing
More information on our research in the Research database.
Research database

Related units

Helsinki Institute for Information Technology HIIT (external link)

HIIT is a joint research institute of Aalto University and the University of Helsinki for basic and applied research on information technology.

HIIT

Finnish Center for Artificial Intelligence FCAI (external link)

Nation-wide competence center for Artificial Intelligence in Finland.

Finnish Center for Artificial Intelligence

Research areas

Research areas in the Department of Computer Science

Department of Computer Science
PML Research Group in Department of Computer Science

Department of Computer Science

Modern computer science to foster future science and society.

Artistic depiction of a bright light in space / made by Ray Scipak

School of Science

Science for tomorrow’s technology, innovations and businesses

  • Published:
  • Updated:
Share
URL copied!