Creative Writing
- A Kid's Guide to Coming Out » Fall 2017
This story was published in Introducing Magazine. I originally wrote this as part of ENGL 298: Introduction to the Genre of Fiction. The title and format are inspired by Lorrie Moore's book of Short Stories Self-Help (which I highly recommend).
Technical Writing
- Honors Undergraduate Thesis » Spring 2020
- Introduction to Secure Multi-Party Computation: Garbled Circuits » Fall 2019
- Dynamic Programming Supplemental Handout » Fall 2019
- Security of Blockchain » Fall 2019
- Gödel's Incompleteness Theorem » Spring 2019
- Research Proposal: Automated Poetry Generation » Fall 2018
- Number Theory and Cryptography Supplemental Handout » Fall 2018
- The Million Dollar Question: How Hard is that Problem? » Fall 2018
For my honors undergraduate thesis, I researched data efficiency in named entity recognition (NER). NER is the task of extracting named entities from text and classifying them using pre-defined categories (e.g. persons, locations, or organizations). State-of-the-art NER models necessitate significant amounts of human-annotated ground-truth data, and the process of annotation is expensive and time consuming. Thus, a crucial research question is how we can more efficiently collect and use human-annotated ground-truth data. In my thesis, I explore two techniques for data efficiency in NER -- entity triggers and adversarial data augmentation.
For my course CSCI 476: Cryptography: Secure Communication and Computation, I researched secure multi-party computation (SMPC), focusing on Yao's garbled circuits. I wrote my term paper on garbled circuits, and I presented our class' first lecture on SMPC. My slides can be viewed here, and my paper can be seen here.
This is a supplemental handout I wrote while course producing CSCI 270: Introduction to Algorithms and the Theory of Computing. Many of the students felt that they could understand dynamic programming solutions when we presented them, but had trouble coming up with the solutions on their own. In my opinion, creative problem solving is the most important skill to take away from this class, so I wrote this handout hoping it would provide students with an approach to solving dynamic programming problems.
This is a glimpse into how Blockchain works and the mathematics behind its security. I wrote this for CSCI 476: Introduction to Modern Cryptography. The audience is meant to have a basic understanding of cryptography and probability.
This was my final paper for CSCI 499: Theory of Computation. This is a detailed summary of Gödel's Incompleteness Theorem written for an audience of CS undergraduates. Although — perhaps because — Gödel's paper took me more hours to read than there were pages, I had a lot of fun working on this project.
This is the research proposal for my honors undergraduate thesis. This proposal details past research on poetry generation, past research on creative generation using deep learning, and my plan to combine the best of these techniques towards automated poetry generation. I presented my proposal at the Viterbi Student Speaker Symposium in November 2019. My slides can be viewed here, and my research proposal can be seen here
This is a supplemental handout I helped write when I was course producing CSCI 270: Introduction to Algorithms and the Theory of Computing. Many of the students were struggling with the concepts of number theory and cryptography that were presented in lecture, so I wrote this handout in conjunction with the professor. My main contribution was "Section 2: Public-Key Cryptography."
This is a magazine article I wrote for WRIT 340: Technical Writing. P vs NP is a famous topic in CS theory. This article is meant for the average person and aims to explain the question of P =? NP as well as why it's important.