Algorithms and Complexity

I am a postdoctoral researcher at the Department of Computer Science and Technology at the University of Cambridge, advised by Prof Tom Gur.  Prior to that, I was a research associate at the Department of Physics, Imperial College London, after completing my PhD in physics at the University of Oxford (Jesus College).

I am a third-year PhD student in the Department of Computer Science and Technology at the University of Cambridge, where I am extremely fortunate to be under the supervision of Tom Gur. My current research interests lie primarily in zero-knowledge proof systems, although I am broadly interested in theoretical computer science at large. 

I am an 1851 Research Fellow at the Department of Computer Science and a College Research Associate affiliated to Sidney Sussex College. I formerly held positions as an Assistant Professor (Research-focused), Research Fellow, and Postdoctoral Research Associate in the Department of Computer Science at the University of Warwick between September 2020 and August 2023.

See https://www.cs.toronto.edu/~rosenthal/

I am a postdoctoral research associate in the Logics and Algorithms group led by Anuj Dawar. My research interests revolve around logic and complexity and lie mainly in the areas of finite model theory and propositional proof complexity. One topic I am specifically interested in at the moment are methods for studying the limitations of symmetric computation models and proof systems. This includes the logic Choiceless Polynomial Time as well as different kinds of symmetric circuits.