I am an assistant professor in the department of Computer Science and Software Engineering at Concordia University. Broadly speaking, I am interested in theory of computation. I like to work on both complexity theory (a.k.a. lower bounds) and algorithm design (a.k.a. upper bounds). My current research interests lie in online algorithms, communication complexity, information theory, and propositional proof complexity. I also like thinking about conceptually simple algorithms (e.g., simple greedy, dynamic programming, and linear programming based algorithms). In the words of Leonardo da Vinci, “simplicity is the ultimate sophistication”.
For more technical information, you may wish to consult my publications.
If you are an accomplished and hard-working student interested in theory of computing, I strongly encourage you to apply to Concordia University.
PhD in Computer Science, 2015
University of Chicago, advisor: László Babai
MSc in Computer Science, 2013
University of Chicago, advisor: László Babai
BSc in Computer Science, 2009
University of Toronto
Winter 2017: course instructor at the University of Toronto for: CSC373: Algorithm Design, Analysis and Complexity
2009-2015: course TA at the University of Chicago for: