A proof and a fast implementation are often the same idea.

I recently graduated from the University of Maryland with dual B.S. degrees in Computer Science and Mathematics, completing the four-year program in two years. I am currently pursuing an M.S. in Computer Science at Columbia University. My engineering background spans data architecture for defense contractors, computer vision research for surgical planning, and writing real-time control software for autonomous Mars rovers.

Most of what I enjoy sits in the gap between the two disciplines: a bound that tells you a data structure cannot be faster, a cache line that says the bound was optimistic, and the work of reconciling them. I like building tools other people can poke at, which is why so much of what I write ends up rendering something.

Away from a terminal I read a great deal of analysis I do not fully understand yet, play chess badly and quickly, and keep a running list of problems I intend to come back to.