Biography:Karem A. Sakallah
Karem Sakallah is an American electrical engineer and computer scientist, a professor at University of Michigan[1] known for his work on computational logic, functional verification, SAT solvers, satisfiability modulo theories, and the Graph automorphism problem.[2][3] He was elevated to the rank of IEEE Fellow in 1998.[4] In 2009, he shared the CAV (Computer Aided Verification) award with eight other individuals "for major advances in creating high-performance Boolean satisfiability solvers."[5] In 2012, Sakallah became an ACM Fellow "for algorithms for Boolean Satisfiability that advanced the state-of-the-art of hardware verification."[6][7]
In 2014, Sakallah help shape the development of the Qatar Computing Research Institute (QCRI) in Doha and supervised the growth of the Cyber Security Research Area.[8]
References
- ↑ "Professor Karem Sakllah". University of Michigan Department of EECS. https://web.eecs.umich.edu/~karem/.
- ↑ "Talk by Karem Sakallah: Faster Symmetry Discovery using Sparsity of Symmetries". Microsoft Corp. February 27, 2009. https://www.microsoft.com/en-us/research/video/faster-symmetry-discovery-using-sparsity-of-symmetries/.
- ↑ "Visiting Researcher: Karen Sakallah". Simons Inst for the Theory of Computing. https://simons.berkeley.edu/people/karem-sakallah.
- ↑ "Fellows directory". IEEE. https://www.ieee.org/membership/fellows/fellows-directory.html.
- ↑ "CAV award". International Conference on Computer-Aided Verification. http://i-cav.org/cav-award/.
- ↑ "Award recipients: Karem Sakallah". ACM. https://awards.acm.org/award-recipients/sakallah_3682317.
- ↑ List of fellows of the Association for Computing Machinery
- ↑ "Karem Sakallah Continues Commitment to Qatar Computing Research Institute". Computer Science and Engineering School, University of Michigan. 3 February 2014. https://cse.engin.umich.edu/stories/karem-sakallah-continues-commitment-to-qatar-computing-research-institute.
 |  |
