معرفی
Denis Pankratov serves as an Associate Professor in the Department of Computer Science and Software Engineering at Concordia University, focusing on theoretical computer science with emphasis on bridging worst-case theoretical guarantees and practical algorithm performance through information-theoretic approaches.
His educational background:
- Bachelor's degree from University of Toronto
- Master's and PhD from University of Chicago
- Three-year postdoctoral fellowship at University of Toronto
His research spans algorithm design and analysis, online algorithms, communication complexity, information theory, proof complexity, and analysis of Boolean functions. He investigates why algorithms like Boolean satisfiability solvers and linear programming implementations often outperform worst-case theoretical predictions in real-world applications.
Dr. Pankratov has supervised postdoctoral researchers, Master's and PhD students, and undergraduate summer research students. His teaching portfolio includes large-enrollment courses (80-150 students) at Concordia University and University of Toronto covering computation theory, probability, statistics, and advanced algorithms. Prior to academia, he held positions at Toyota Technological Institute at Chicago, Google Inc. (Mountain View), and Zurich Insurance Company.
