Projects

Below, you will find some links to resources, projects, slides, etc. that I’ve worked on over the years. These are listed in roughly reverse chronological order. (Most recent projects first.)

Communication Complexity: A Crash Course (Course Presentation)

This was the final presentation I did in my directed studies course on computational complexity. It was an introduction to communication complexity, which is a mostly self-contained offshoot of complexity theory that examines how much communication is required for multiple machines to work together to solve a problem. The caveat here is that each machine only has a partial view of the total input required to solve the problem, so the machines must communicate.

Slides: Communication Complexity: A Crash Course

Multiprogramming a 64kB Computer Safely and Efficiently (Course Presentation)

This is a presentation I prepared for COMP 5407: Authentication and Software Security at Carleton University. The stated aim of the course project was to present the paper Multiprogramming a 64kB Computer Safely and Efficiently by Amit Levy, Bradford Campbell, Branden Ghena, Daniel B. Giffin, Pat Pannuto, Prabal Dutta, and Philip Levis. However, through reading this paper I realized that it’s actually about the creation of the Tock operating system, which is a security-focused embedded OS for microcontrollers. I felt like talking about the paper without providing some broader context on Tock would be a massive disservice to students in the class, so my presentation ended up being mostly about Tock, the context around its creation, and the security goals and trust model that emerged during the process of working on Tock.

Slides: Multiprogramming a 64kB Computer Safely and Efficiently

Circuits, Parallelism, and Quantum Advantage (Course Project)

This is a report and presentation I prepared for COMP/MATH 4803: Computable Functions at Carleton University. The aim was to introduce the paper Quantum Advantage with Shallow Circuits by Bravyi, Gosset, and König. Because this was a computability theory course and most of the class did not have a background in quantum computing, my goal was to bring the class up to speed on concepts required to understand the paper and give a sketch of the results, their significance, and an idea of why they are true.

Report: Circuits, Parallelism, and Quantum Advantage
Slides: Quantum Advantage with Shallow Circuits… whatever that means

Supermodularity, Iterative Peeling, and Densest Subgraphs (Course Project)

This is a report and presentation I prepared for COMP 5112: Algorithms for Data Science at Carleton University. The aim was to break down and understand a recent paper by Chekuri, Quanrud, and Torres called Densest Subgraph: Supermodularity, Iterative Peeling, and Flow which studies the densest subgraph problem through the lens of supermodular set functions.The report covers a (very brief) introduction to the theory of submodular functions and gives extended presentations of some ideas in the original paper.

Report: Supermodularity, Iterative Peeling, and Densest Subgraphs
Slides: Densest subgraphs, iterative peeling, and supermodularity