Areas of interest
Propositional satisfiability and finite domain constraint satisfaction results on the complexity of these problems aspects of design of practical algorithms for SAT and CSP application to formal verification and related tasks
Education
- Ph.D., Computer Science, University of Toronto, Canada, 2002
- M.Sc., Computing Science, ¶¡ÏãÔ°AV, Canada, 1993
- B.Sc., Cognitive Science and Artificial Intelligence, University of Toronto, Canada, 1989
Courses
This instructor is currently not teaching any courses.