Hello! I'm Jun-Ting Hsieh, though I go by the name "Tim". I am currently a C.L.E. Moore Instructor of Mathematics at MIT (departmental postdoc).

I am broadly interested in Theoretical Computer Science. Recently, I've been thinking about expander graphs and other pseudorandom objects, and their connections to algorithms beyond the worst case. More generally, my research interests (and prior work) include explicit constructions, coding theory, average-case complexity, semidefinite programming and the Sum-of-Squares hierarchy, and extremal combinatorics.

Before MIT, I completed my PhD in the Computer Science Department at Carnegie Mellon University, where I was fortunate to be advised by Pravesh K. Kothari. My PhD thesis can be found here.