Faculty of Engineering Sciences

Algorithms and Computations –PhD

The main goal of this advanced interdisciplinary program is deep understanding of theoretical bases of computer science and engineering toward wise applications of them in our challenging world. Today, a fundamental change is taking place and the focus is more on applications. Some of the more important reasons for this change are the emergence of social and sensor networks. One of the major changes is the switch from discrete mathematics to more on emphasis on probability, randomized algorithms, approximate algorithms, formal methods, verification and model testing, and new aspects of data and its manipulations. Some topics that have become important are high dimensional data, large random graphs, singular value decomposition, and bioinformatics algorithms which this program is pointed to them.     

Four Years

The main core of this program consists of analysis of algorithms based on probability, game theory, linear algebra, approximation, randomization, optimization theory,  and advanced graph theory.  The graduate students are able to apply their deep understandings of computer science toward the applied cases.  Using graph and network algorithms, randomized algorithms, advanced databases theory in solving real world problems are some the capabilities of the graduate students of this program.