My name is Gregory Rosenthal. I am a fourth-year MSc/PhD student at the University of Toronto, where I am fortunate to be co-advised by Benjamin Rossman and Henry Yuen. Previously I was a math major and computer science minor at Cornell. My research interests are in computational complexity theory and related areas, including quantum circuit complexity and boolean function analysis.
rosenthal at cs dot toronto dot edu
Bounds on the QAC0 Complexity of Approximating Parity
Beating Treewidth for Average-Case Subgraph Isomorphism
IPEC 2019 (Best Student Paper Award) (slides)
under review for the Algorithmica Special Issue for IPEC 2019
University of Toronto
|Fall 2020||CSC 2426||Fundamentals of Cryptography (1/2 TAship)|
|Fall 2020||CSC 2429||Advanced Topics in Quantum Information Theory (1/2 TAship)|
|Summer 2020||CSC 336||Numerical Methods|
|Winter 2020||CSC 463||Computational Complexity and Computability|
|Fall 2019||CSC 373||Algorithm Design, Analysis and Complexity|
|Summer 2019||CSC 263||Data Structures and Analysis|
|Winter 2019||CSC 2556||Algorithms for Collective Decision Making|
|Fall 2018||CSC 2451||Quantum Computing: Foundations to Frontier|
|Summer 2018||CSC 165||Mathematical Expression and Reasoning for Computer Science|
|Winter 2018||CSC 473||Advanced Algorithm Design|
|Fall 2017||CSC 373||Algorithm Design, Analysis and Complexity|
|Spring 2016||CS 4820||Introduction to Analysis of Algorithms|
I was fortunate to attend much of the Fall 2018 program Lower Bounds in Computational Complexity at the Simons Institute for the Theory of Computing.
From Jan. 2018 to July 2019 I coordinated the weekly Cookiebreak for grad students in the department. I play cello in an orchestra on campus, and as an undergrad I played in the Cornell Orchestras and also conducted the Cornell Eastern Music Ensemble. In Summer 2013 and Summer 2014 I was a resident assistant at AwesomeMath Summer Program (AMSP).