Doctoral International Program in Communications and Computer Engineering
36 monthsProgramme duration
3,629 Tuition Fee/year
Apr, OctStarting Month
Programme overview
Main Subject
Computer Science and Information Systems
Degree
PhD
Study Level
PhD
Study Mode
On Campus
Two introductory graduate classes are provided, neither of which is designed solely for international students. Introduction to Algorithms and Informatics is an introductory class for non-specialists. Lectures cover various aspects of modern computer science, particularly the fundamentals of algorithm design and analysis, data structures, and important concepts such as linear programming, randomization, heuristics and approximation. Theory of Computational Complexity is an introduction to the field of computational complexity, which aims at classifying computational problems according to their difficulty by investigating the amount of resources needed to solve them.
The class covers both the foundations of computational complexity and more advanced topics such as hardness of approximation and communication complexity. For both classes no specific technical background is required. Other classes given in English are System Verification, System-Level Design Methodology for SoCs, and Atmospheric Measurement Techniques. Students can also take the general Perspectives in Informatics seminars, as well as classes in the other two international courses offered by the School of Informatics.
Programme overview
Main Subject
Computer Science and Information Systems
Degree
PhD
Study Level
PhD
Study Mode
On Campus
Two introductory graduate classes are provided, neither of which is designed solely for international students. Introduction to Algorithms and Informatics is an introductory class for non-specialists. Lectures cover various aspects of modern computer science, particularly the fundamentals of algorithm design and analysis, data structures, and important concepts such as linear programming, randomization, heuristics and approximation. Theory of Computational Complexity is an introduction to the field of computational complexity, which aims at classifying computational problems according to their difficulty by investigating the amount of resources needed to solve them.
The class covers both the foundations of computational complexity and more advanced topics such as hardness of approximation and communication complexity. For both classes no specific technical background is required. Other classes given in English are System Verification, System-Level Design Methodology for SoCs, and Atmospheric Measurement Techniques. Students can also take the general Perspectives in Informatics seminars, as well as classes in the other two international courses offered by the School of Informatics.
Admission Requirements
Tuition fees
Domestic
International
Scholarships
Selecting the right scholarship can be a daunting process. With countless options available, students often find themselves overwhelmed and confused. The decision can be especially stressful for those facing financial constraints or pursuing specific academic or career goals.
To help students navigate this challenging process, we recommend the following articles:
Get closer to your dream programme
Your consent preferences have been set.
Time to start exploring.
Your account has been removed.
You can still browse the site or sign up again once you have parental consent.
Get closer to your dream programme