Complexity of algorithms

Michal A. Mankowski

Postdoctoral Research Fellow, Computer Science

Dynamic programming Combinatorial machine learning Complexity of algorithms discrete optimization

As a member of the KAUST Extensions of Dynamic Programming, Machine Learning, Discrete Optimization research group (TREES), Mankowski is currently developing an algorithmic and theoretical framework for combinatorial optimization. The application side of his research centers on healthcare analytics and operations research applied to the healthcare domain. Research Interests Dynamic programming Combinatorial optimization Complexity of algorithms Healthcare Analytics Education Profile Ph.D. (Computer Science), King Abdullah University of Science and Technology, Thuwal, Saudi Arabia, 2020. M.S.