معرفی
Michael Soltys is an Adjunct Professor in the Department of Computing and Software at McMaster University. His work bridges theoretical computer science, algorithms, and practical applications in cybersecurity and education.
- Research interests include logic, circuit complexity, and pairwise comparisons.
- Publications span 2002–2021, with recent focus on cloud computing education, digital forensics, and graph theory.
- Active in academic service through editorial contributions (e.g., Foreword for Franco-Canadian workshop proceedings).
His scholarly activity maps to subdisciplines such as Computer Systems Theory, Logic, Discrete Applied Mathematics, and Operations Research.
Dr. Soltys' work on pairwise comparisons and clique covers provides foundational insights for decision systems and graph optimization. He has also contributed to cloud curriculum development and malware analysis frameworks.
As an educator, he co-authored An Introduction to the Analysis of Algorithms (2018, 2012, 2009), a textbook exploring algorithmic foundations.
Current affiliations include the McMaster Experts database, with collaborations across theoretical computer science and applied cybersecurity research.
