- Finite Automata
- Boolean Circuit
- Formal Language
- +۳ مورد دیگر
Pierre McKenzie is an Associate Professor in the Department of Computer Science and Operations Research at the University of Montreal, part of the Faculty of Arts and Sciences. He is a member of the LITQ (Laboratoire d'informatique théorique et quantique). His research focuses on computational complexity theory, finite automata, Boolean circuits, formal languages, and logic. He has advised numerous graduate and master's students, including Hugo Côté, Nathan Grosshans, and Michael Blondin. His work has been supported by grants from the Natural Sciences and Engineering Research Council of Canada (CRSNG), particularly in projects like 'Lower bounds and derandomizations for branching programs' (2018–2026). Research Interests: Computational complexity hierarchy separations Branching programs and circuit lower bounds Automata theory and its connections to circuit complexity Algorithmic and complexity aspects of counter systems Key Projects: Lower bounds and derandomizations for branching programs (Lead researcher, 2018–2026) THE COMPUTATIONAL COMPLEXITY OF POLYNOMIAL TIME PROBLEMS (Lead researcher, 2012–2019) Labs/Teams: Active member of LITQ, contributing to theoretical computer science research.













