I am a first year Ph.D. student in applied mathematics at the University of Maryland, with particular interest in numerical linear algebra and scientific computing. I received my B.S. in computer science and mathematics from the University of Virginia in May 2024.
Out of the office, I enjoy running, movies, studying Japanese, and going to trivia in D.C. Check out my travel and bookmarks pages!
I am interested in complex-valued functions, particularly methods of visualization that convey the locations of zeros, poles, branch cuts, and natural boundaries. As a foray into CUDA programming, I wrote a library for performing two such methods, plus one for iterated fractals such as the Mandelbrot set. Details can be found in my thesis.
After learning about the minimax algorithm, I decided to write my own command-line chess implementation in C++. There are still a few kinks to work out (en passant, castling), but it's mostly at a point that I'm happy with. In the future, I am interested in applying the minimax algorithm to other games.
Discussion sections 0332 and 0342 under Archana Khurana. The most recent copy of my lecture notes can be found here.
Discussion sections 0112 and 0122 under Hatice Sahinoglu
Returned to the XLA team for more work on the algebraic simplifier to resolve regression, add more rewrites, and build out fuzzy pattern matching.
Worked with the XLA team on the algebraic simplifier to optimally reassociate Dot operations fed by a Broadcast, Reduce, Pad, Slice, Reverse, or another Dot.
Worked with the Logs team designing dashboards to query and meaningfully visualize data.