Dr. Arturs Backurs

Research Assistant Professor


Arturs Backurs received Ph.D. degree from MIT in 2018. He previously received his bachelor’s degree from University of Latvia in 2012.

His research area is theoretical computer science with the main focus on proving conditional lower bounds for problems that are solvable in polynomial time as well as designing faster algorithms inspired by the hardness results.

Dr. Backurs also has a personally maintained website which can be found at http://www.ttic.edu/backurs.