Solvers, ML, Logic, and Complexity
Description: Shyan Akmal is a fifth-year PhD candidate at MIT, interested in fine-grained complexity and algebraic algorithms. On this page you can see his research, and find some fun math problems.
I am a fourth-year PhD candidate studying Theoretical Computer Science at MIT, grateful to be advised by both Virginia Vassilevska Williams and Ryan Williams .
I am interested in fine-grained complexity and algorithm design, and especially enjoy thinking about problems concerning graph algorithms, string algorithms, and applications of algebraic methods in computer science.
Previously, I received a B.S. in Computer Science & Mathematics from Harvey Mudd College. I have been fortunate to have several excellent mentors and, in particular, am indebted to JJP Veerman for introducing me to research, Mohamed Omar for helping foster my interest in combinatorics, Jim Boerkoel for showing me how fascinating computer science research could be, and Ran Libeskind-Hadas for sparking my interest in theoretical computer science.
Solvers, ML, Logic, and Complexity