Talks
Why does Theory Matter in Computer Science?
A talk I did for the Carleton Computer Science Society Tech Talk Night on November 19th, 2024. It aims to explain why we make computer science students take theory courses, the importance of abstraction and generalization in problem solving, and how we can apply theory and/or math to solve real-world problems. I also discussed the densest subgraph problem, some algorithms for solving the problem, and some generalizations of the densest subgraph problem.
This presentation was intended to be self-contained and accessible to an audience of second year computer science students. I have also adapted the content of the talk into a blog post, for anyone who is interested but could not attend.
Blog Post: Why does theory matter in computer science?
Slides: Why does theory matter in computer science? (as originally presented on November 19th, 2024)
Hypergraphs, Approximation Algorithms, and the Densest Subgraph Problem
A guest lecture I did for the first year discrete structures course (COMP 1805) at Carleton University, in June 2024. This talk was intended to expose the students to how the math they were learning could be applied in other contexts, and serve as an introduction to the research I was doing under the supervision of Dr. Yuly Billig. A huge thank you goes out to Dr. Alexa Sharp for giving me the opportunity to lecture to her class! I also talked a bit about undergraduate research opportunities and how the research process felt. Lecture Video: COMP 1805 Summer 2024, Guest Lecture - June 13th
Lecture Notes: Hypergraphs, Approximation Algorithms, and the Densest Subgraph Problem
How To Be a “Talentless Hack” in Public
A talk I did for the Carleton Computer Science Society Tech Talk Night on March 1st, 2023. It is about imposter syndrome, its ramifications, and techniques for preventing imposter syndrome from taking over and ruining your life. I also converted this presentation into a blog post and a zine!
Zine: How to Be a “Talentless Hack” in Public
Blog Post: How to Be a “Talentless Hack” in Public