Computational Theory and Algorithms

Foundations of Computing: Push the boundaries of theoretical computer science, focusing on complexity theory, algorithm design, and automata theory.

Algorithmic Innovations: Design efficient and provably correct algorithms for machine learning, optimization, data analysis, and other practical domains.

Optimization for Real-World Problems: Develop novel optimization techniques for diverse applications, including logistics, scheduling, resource allocation, and control systems.

 

The faculty of the computer science department are involved in the following key research areas:

  • Algorithms and Computational Complexity
  • Algorithm Design and Analysis
  • Continuous and combinatorial optimization
  • Algorithmic game theory
  • Operations research