Joshua A. Grochow is an assistant professor of computer science and mathematics at CU Boulder. His work focuses on two deeply - but not obviously - related themes:
- understanding the ultimate limits of computation (computational complexity), especially in their two-way relationship with algebraic geometry, representation theory, and group theory, and
- developing the theory of complex systems and complex networks.
Prior to his current position, he was an Omidyar Fellow at the Santa Fe Institute and a postdoc in the CS Theory group at the University of Toronto. He got his PhD in CS from the University of Chicago, an MEng in CS focusing on computational biology from the Massachusetts Institute of Technology, and undergraduate degrees in CS and mathematics from MIT.