I am the recipient of an NSERC Undergraduate Summer Research Award for Summer 2020. I am working with Prof. Michael Lipnowski to design sorting algorithms on manifolds with the goal of efficiently building grids on these spaces.
COMP 400 Honours Project in Computer Science
During the Fall 2019 semester, I undertook a project in the Computation and Logic lab under the supervision of Prof. Brigitte Pientka. I worked with Jacob Errington to develop a typechecking algorithm for the Harpoon proof language as well as a translation procedure to convert Harpoon proof scripts into programs in the Beluga programming language. The summary of the work I helped with can be found in the slides to my end-of-term presentation, and my full report is available for download as well.
S1. (with Anna M. Brandenberger and Luc Devroye) Root estimation in Galton-Watson trees. arXiv preprint 2007.05681. Submitted July 2020.
R1. Typechecking proof scripts: making interactive proof assistants robust. Honours project report, McGill University (Montréal, Québec, December 2019), 10 pp.
I contributed the following sequences to the OEIS:
- A335562: The number of unlabelled unary-binary trees with $n$ nodes such that every node with two children has children of different subtree sizes.