Since April 2014, John Lapinskas has been a postdoctoral researcher in computer science working with Leslie Goldberg at the University of Oxford. Prior to that, he was a PhD student in mathematics at the University of Birmingham under Daniela Kühn (co-supervised by Deryk Osthus), winning the Ratcliffe Prize. Lapinskas also holds an MA and an MMath from the University of Cambridge.
His main research interests are in computational complexity and graph theory. He is particularly interested in approximate counting problems, randomised algorithms, quantum computing, random graphs and extremal graph theory.
- Counting Complexity and Phase Transitions, Spring 2016. Visiting Postdoc.