Searching for summer 2027 internships in quantitative researchSearching for 2027 quant research internships
Ethan Mader
I am a Computer Science PhD student at Purdue University, advised by Kent Quanrud. My research interests include randomized algorithms, graph algorithms, and complexity theory. I also help organize the Purdue Theory CS Seminar.
I graduated from UC Santa Barbara in spring 2024 with a B.S. in Computer Science and a B.S. in Mathematics. I love theory, and am hoping to apply my abstract skillset to practical problems.
Long term, I'm interested in algorithms research in industry. If you are interested in networking, collaborating, or have any questions, feel free to reach out!
Puzzles of the day
Knights and Bishops
Two games I invented, each with a new puzzle every day.
Recently
- New preprint on arXiv: Kalah is PSPACE-complete. arXiv
- New preprint on arXiv: a strongly subquadratic (3+ε)-approximation for weighted edit distance over arbitrary metrics. arXiv
- TA for CS 381, Analysis of Algorithms. The PSO problem sets are here.
- Manuscript: a faster 3-approximation for sublinear edit distances. PDF



