Mohammad Salavatipour, PhD

Professor, Faculty of Science - Computing Science

Contact

Professor, Faculty of Science - Computing Science
Email
mreza@cs.ualberta.ca

Overview

About

Education

  • B.Sc., Computer Engineering, Sharif University of Technology, 1998 
  • M.Sc., Computer Science, University of Toronto, 2000 
  • Ph.D., Computer Science, University of Toronto, 2003



Research

Area

Algorithmics

Interests

Approximation Algorithms, Hardness of Approximation, Algorithmic Graph Theory, Probabilistic and Randomized Algorithms.

Summary

I am interested in design and analysis of algorithms; in particular approximation algorithms and hardness of approximation. Most of these problems are optimization problems that are known to be hard. Our goal is to design efficient algorithms with provable guarantee on the quality of the solution with respect to the optimum one. These problems arise in various applications such as clustering problems, vehicle routing, scheduling, and network design.

Courses

CMPUT 272 - Formal Systems and Logic in Computing Science

An introduction to the tools of set theory, logic, and induction, and their use in the practice of reasoning about algorithms and programs. Basic set theory; the notion of a function; counting; propositional and predicate logic and their proof systems; inductive definitions and proofs by induction; program specification and correctness. Prerequisites: CMPUT 101, 174, 175, 274, or SCI 100.


Browse more courses taught by Mohammad Salavatipour