|
Theoretical Computer Science |
- Algorithmic Game Theory
- Design and Analysis of Algorithms, Distributed Computing, Communication Networks
- Yeow Meng Chee: Combinatorics, Cryptography and Coding Theory.
- Ning Chen: Algorithms, Algorithmic Game Theory and Internet Economics.
- Xin Chen: Bioinformatics and Algorithms.
- Edith Elkind: Algorithmic Game Theory and Computational Social Choice.
- Gopal Pandurangan: Algorithms, Distributed Computing, Communication Networks.
- Dmitrii Pasechnik: Combinatorics, Optimization, Computational Complexity, Computer Algebra and Symbolic Computing.
- Huaxiong Wang: Cryptography, Coding Theory and Information Security.
- Guohua Wu: Computability, Models of Computation, Computational Complexity and Logic.
- John Augustine: Optimization Algorithms, Algorithmic Game Theory
- Angelo Fanelli: Algorithms, Computational Complexity, Algorithmic Aspects of Game Theory
- Nikolay Gravin: Graph Theory, Algorithms, Algorithmic Game Theory
- Svetlana Obraztsova: Graph Theory
- Hua Xia: Algorithmic Game Theory
- Wang Kejun: Algorithmic Game Theory
- Yu Lan: Algorithmic Game Theory
- Dmitry Shiryaev: Algorithmic Game Theory
- Yair Zick: Algorithmic Game Theory
-
- December 12-14, 2008, NTU-Tsinghua Workshop on Discrete Mathematics and Theoretical Computer Science, NTU, Singapore.
- July 20-22, 2009, School of Physical and Mathematical Sciences official opening, NTU, Singapore.
- August 5, 2009, The First Singapore Workshop on Algorithmic Game Theory, NTU, Singapore.
Theoretical computer science aims to understand the state of art of computation. The theory group at NTU focuses particularly on computability, algorithms, coding theory, cryptography, algorithmic game theory, optimization and bioinformatics.
We are hiring, from full time tenure-track or tenured faculty positions,
including all areas of Theoretical Computer Science, to postdocs and Ph.D. students.
Details on how to apply for postdoc/PhD positions can be found here: