profile pic

Grayson Y

- Research Program Mentor

MS candidate at Duke University


Computer Science theory, particularly complexity theory or algorithms. Also interested in game theory, especially applications of computational methods to microeconomic theory and political science.


I am interested broadly in computer science theory. In particular, I am interested in applying algorithms and complexity to fields such as social science and mathematical biology. Previous problems I have worked on include studying joint venture formation in the oil industry, studying gerrymandering in North Carolina, studying the spread of disease and the effect of social distancing measures, and I am currently using tiling theory to study the computing properties of DNA. In my spare time I enjoy traveling and playing games. I generally enjoy road trips, and have driven across the country several times. I have been playing Go for several years, and I have recently picked up Poker.

Project ideas

Project ideas are meant to help inspire student thinking about their own project. Students are in the driver seat of their research and are free to use any or none of the ideas shared by their mentors.

Literature Review of Recent Work in Tiling Theory

Tiling theory is a fascinating field of mathematics with applications to DNA computing. Problems essentially relate to which pictures can be created by jigsaw puzzle pieces which can connect in different ways. This field is moving fast, and a lot of interesting work is being done, but a lot of loose ends are left behind that need to be tied up, and a lot of existing work needs to be made more accessible. This project would start with a crash course on complexity theory and methods in theoretical computer science, and then move into reading primary literature in tiling theory and compiling that work into a literature review describing current methods of computing with DNA.

A Study on the Mathematical Properties of Elections

In recent years, there has been a lot of discussion about which election mechanism is most effective at achieving various goals. Proposed mechanisms in united states elections include majority elections, the electoral college, approval voting, and ranked choice voting. All of these mechanisms have benefits and drawbacks, and it turns out that no perfect election mechanism can exist. In this project we will look at the work being done by political scientists, economists, mathematicians, and computer scientists to understand when elections fail, and what can be done to improve them.

Coding skills


Teaching experience

Tutored students in high school math and physics, and worked as a TA in several courses at the undergraduate level in computer science theory.


Work experience

Seagate (2021 - 2022)
Duke (2020 - Current)
Math/Computer Science Course Staff


Duke University
BS Bachelor of Science (2021)
Math, computer science double major
Duke University
MS Master of Science candidate
Computer Science

Interested in working with expert mentors like Grayson?

Apply now