I work on several projects, creating internal tools and infrastructure, some used Google-wide and some tailored for Displays Ads use cases.

I develop internal tools and infrastructure for a Display Ads team.The Software Engineer, Tools and Infrastructure (SETI) job position was merged into the Software Engineer (SWE) job position in May 2019.

Number Theory (MATH 317) is an upper-level mathematics course at Oberlin, taught using Inquiry-Based Learning (IBL). Instead of attending lectures during class time, students prove the content of the course themselves through problems designed to break up the important theorems into manageable pieces. There is no textbook for the course; instead students build their own during the course of the semester. During class, the professor and TA are available to answer questions when students get stuck. This style of teaching fosters mathematical creativity and critical thinking.As the TA, I functioned as a second instructor during class time by answering students questions about the material and helping to guide them through any problems they were stuck on. In addition, I held open office hours twice a week, assisting students with their own proofs of important theorems from elementary Number Theory.

Python/Java Lab Helper, Spring and Fall 2014Data Structures Lab Helper, Spring and Fall 2014Algorithms Grader, Spring 2015Theory of Computer Science Office Hours TA, Spring 2016Held various TA positions within the Computer Science department:Evening Lab Helper (CS150, CS151): Assisted students with code and implementation questions for Intro to CS (Python) and Data Structures (Java) during open office hours.Data Structures Lab Helper (CS151): Assisted students with code and implementation questions for Data Structures during class time. Topics included lists, stacks/queues, trees, hash tables, graphs, etc.Algorithms Grader (CS280): Graded students' proofs for correctness, big O correctness, and LaTeX readability. Topics included greedy, dynamic programming, divide and conquer, network flow, NP reductions, etc.Theory of Computer Science Office Hours TA (CS383): Held open office hours for questions on proof techniques and concepts from the upper level theory course. Topics included automata, context-free grammars, Turing machines, undecidability reductions, etc.

Often considered one of the top three mathematics Research Experience for Undergraduates (REU) in the country, SMALL is a NSF funded summer research program. I was part of the Number Theory and Harmonic Analysis group.I was a member of two projects. The first was concerned with Zeckendorf Decompositions, a way to represent numbers using sums of Fibonacci numbers. The second was concerned with sums of Fourier coefficients of holomorphic cusp forms. I was a co-author of three papers as a result of the research.Faculty mentors: Dr. Steven J. Miller and Dr. Eyvindur Palsson

A highly selective NSF and NSA funded Research Experience for Undergraduates (REU). I worked with a team of four other undergraduates in addition to a mathematics faculty member and graduate student doing mathematics research. The area of research is called combinatorics, more specifically set partition and restricted growth function patterns and statistics.Based on this work, I presented at the following four conferences during the summer of 2014.The 12th International Permutation Patterns Conference (Joint talk)Summer Undergraduate Michigan Mathematics Research (Joint talk)MathFest (Joint talk, Outstanding Presentation Award)Young Mathematicians ConferenceOur first paper appeared in the journal Discrete Mathematics in January 2016 (preprint available at http://arxiv.org/abs/1502.00056) and we are in the process of preparing a second paper for publication.Faculty Mentor: Dr. Bruce E. Sagan