Artur Riazanov, Ph.D.

Artur Riazanov is a postdoctoral researcher in Columbia University’s Computer Science theory group. Prior to that he completed his Ph.D. at EPFL in Switzerland under supervision of Mika Göös. Riazanov’s research is centered in concrete computational complexity, seeking to provide unconditional evidence for hardness of computational tasks. During his Ph.D., he worked on hardness of sampling problems, circuit complexity, and communication complexity.