HOME > Course Information > Kyoto University > International Course in Communications and Computer Engineering

URL http://www.g30.i.kyoto-u.ac.jp/en/

This course focuses on the theoretical aspects of modern IT technologies, principally in the following areas:
- Design and analysis of algorithms
- Computational complexity
- Formal specification and verification
- Logic in computer science
- Discrete mathematics related to computer science
Students in this course can also take classes offered by the other two similar courses at the School of Informatics enabling them to study several applications of basic theories in the real world.
Approximately ten faculty and postdoctoral staff members will supervise this course, including Professors Kazuo Iwama, Taichi Yuasa, Associate Professors Hiro Ito and Masahiro Yasugi.
The research interests of Prof. Iwama include the design and analysis of discrete algorithms and complexity theory. His recent publications deal with the following topics:
- Approximation algorithms for the generalized stable matching problem whose approximation factor is strictly less than two
- Several packing algorithms for two and three dimensional objects
- Tight bounds for the competitive ratio of on-line knapsack problems
- The world fastest algorithm for the Boolean 3CNF satisfiability problem
- The first polynomial-time algorithm for designing a general network coding
- Randomized on-line algorithms for k-server problems
- Quantum query complexities for oracle identification problems
- Quantum one-way communication complexities including possibility and impossibility of quantum random access codes Prof. Yuasa is interested in computer programming, particularly in programming languages and related issues, including algorithms, programming paradigms, and language systems. He has been pursuing new language designs for more functionality and better performance, and develops practical language systems equipped with the proposed designs. His recent achievements include the development of incremental garbage collection algorithms and their application for small devices such as mobile phones. He has recently developed two language systems: a compact Lisp system that runs on Lego Mindstorms and a highly portable Scheme system that supports various programming paradigms. These systems are currently being used for educational purposes.
The fields of Prof. Ito's research include design and analysis of discrete algorithms, discrete geometry, and recreational mathematics. In the area of graph algorithms, he is recently presenting constant-time algorithms, e.g. algorithms which run in a constant-time for any given arbitrarily large input. In the area of discrete geometry, Prof. Ito proved the Generalized Hum Sandwich Theorem, which is one of the landmark theorems in the field. Prof. Ito has also produced many other groundbreaking results, for example in his work relating to algorithms for transforming graphs, winning methods for some combinatorial games, an idea of isolated subgraphs and a linear-time algorithm for enumerating all such subgraphs, and problems for locating sources on networks.
The research interests of Prof. Yasugi include the design and implementation of programming languages and parallel processing. His recent publications focus on S-expression based extended C languages, highly efficient dynamic load balancing on parallel and distributed systems, lightweight lexical closures for legitimate execution stack access, and locality-improving data placement using hierarchical clustering copying algorithms.

URL http://www.g30.i.kyoto-u.ac.jp/en/