PhD Defense | Hassan AbouEisha, March 5th 2017

PhD Defense | Hassan AbouEisha, March 5th 2017

3/5/2017
​​​PhD defense​ of our colleague Hassan AbouEisha.
​​
Thesis title: Optimization of Algorithms Using Extensions of Dynamic Programming

During this presentation, we discuss questions related to the complexity of various important problems such as: multi-frontal solvers of hp-adaptive finite element method, sorting and majority. The use of dynamic programming as a viable tool to study optimal algorithms for these problems will be advocated. The main approach used to attack these problems is modeling classes of algorithms that may solve this problem using a discrete model of computation then defining cost functions on this discrete structure that reflect diff erent complexity measures of the represented algorithms. As a last step, dynamic programming algorithms are designed and used to optimize those models (algorithms) and to obtain exact results on the complexity of the studied problems.
 
Biograhy: Hassan Aboueisha received his B.E. degree in computer engineering from the German University in Cairo (GUC) and the M.S degree in computer science from King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia in 2011. He is currently a PhD candidate in the computer science program at King Abdullah University of Science and Technology. His research interests include algorithm design, discrete optimization, graph theory and computational complexity.

Congratulations dr. Hassan Aboueisha!