Computer Science

It all starts with theory! The study of this specialization is based on research in the areas of stringology, data compression, arbology, compiler construction, artificial intelligence, and machine learning. You will become specialists in solving engineering problems, especially in designing and developing efficient algorithms for various parts of computer science.

What will you learn?

You will delve into selected areas of mathematics, complexity theory, algorithmization, and advanced programming. The graduate will have a knowledge of the fields in which FIT achieves internationally recognized research results. You will be able to:

  • Algorithmically solve problems of artificial intelligence
  • Gain knowledge from large-scale data
  • Master advanced algorithmization methods for solving difficult word processing problems

What jobs will you be able to do?

Equipped with excellent theoretical skills, you will definitely not get lost in practical life. You will be sought-after experts to solve engineering problems in designing and developing efficient algorithms for various parts of computer science. You can become:

  • Analyst, developer, or consultant
  • System or data engineer
  • Employee of research institutions

Specialization is focused on these topics

Theoretical Computer Science

We do research in the areas of algorithm theory, stringology, data compression, arbology, compilers, artificial intelligence and machine learning.

Research groups

Arbology

In this group, we focus on research in the theory of algorithms for processing of tree data structures. Examples of tree structures include abstract syntactic trees or XML documents. With regard...

Graphs, Games, Optimization, Algorithms, Theoretical Computer Science (G²OAT)

The G²OAT research group focuses on research in discrete optimization.

The Prague Stringology Club (PSC)

The researchers of the Prague Stringology Club deal with processing one dimensional strings, their efficient storage, and pattern matching. The main research topics are stringology, data...

Guarantor

Department of Theoretical Computer Science

prof. Ing. Jan Holub, Ph.D.

The person responsible for the content of this page: Ing. Zdeněk Muzikář, CSc.