International Course in Communications and Computer Engineering

Enrollment: April/October
Enrollment Limit: a small number of students
Degree: Master’s Degree, Doctoral Degree
URL: http://www.g30.i.kyoto-u.ac.jp/en
Address: Graduate School of Informatics, Kyoto University
Yoshida-Honmachi, Sakyo-ku, Kyoto, 606-8501

Website

Please visit http://www.g30.i.kyoto-u.ac.jp/en/ for details.

Admissions

Course Description:

Lifting a Voronoi diagram to a polyhedron

The focus of this course lies in the theoretical aspects of modern information technologies, principally, the design and analysis of algorithms, computational complexity, and discrete mathematics related to computer science.

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 Parallel and Distributed Systems, 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.

Welcome Message:

Associate Professor in the Department of Communications and Computer Engineering at the Graduate School of Informatics. His research interests include algorithms, complexity theory and quantum computation.

 

Dr. François Le Gall

The computers, interfaces, and networks that the general public use depend on algorithms of one type or another. As the sophistication of end-user applications increases, the algorithmic problems to be solved become extremely difficult and their complexity becomes a significant issue. Many of our students will be interested in research concerning end-user level and technology based communities. However, in order to develop new and more intelligent applications, they will need a thorough knowledge of the ever-evolving and improving algorithmic methods available to them. The goal of our course is to provide this knowledge about modern information technologies in a rich environment where international students and Japanese students fully interact. Our course attracts students from various backgrounds and interests.