Peter Fulla is a PhD student in the Department of Computer Science at the University of Oxford. He received an MSc in computer science from Comenius University in Bratislava. Fulla's main research area is the valued constraint satisfaction problem. He is also interested in efficient data structures and computational complexity in general.
- Counting Complexity and Phase Transitions, Spring 2016. Visiting Graduate Student.