Congratulations to Omar Shehab (CS Ph.D.), who has been awarded two NSF travel grants to attend research conferences this June.
First, Omar has received an NSF travel grant to attend the IEEE Conference on Computational Complexity. The conference celebrates research in all areas of computation complexity theory, taking a look at the absolute and relative power of computational models under resource constraints. Specific topics include probalistic and interactive proof systems, proof complexity, and descriptive complexity. The conference will be held in Palo Alto California, June 5-7.
Omar has also received an NSF travel grant to attend the 45th ACM Symposium on the Theory of Computing (STOC 2013). Here, he will be presenting a poster entited: "Hamiltonian complexity of Trefoil knot transformations." The conference is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). It will explore original research on the theory of computation. The conference will be held in Palo Alto California, June 1-4.
Omar started UMBC’s Computer Science Ph.D. program in 2010. He is currently pursuing research under the supervision of Dr. Samuel J. Lomonaco Jr. Omar’s doctoral work exlpores adiabatic quantum Hamiltonian complexity, quantum computational simulation of topology and use of quantum optics to understand device independent cryptography. He is currently a Teaching Assistant for CMSC 641: Design and Analysis of Algorithms.