Description: Jannis Bulian
machine learning (3481) nlp (1936) deep learning (1147) logic (493) natural language processing (377) algorithms (258) graph theory (16) algorithm design (10) parameterized complexity (3) jannis bulian (1)
I am now at Google Research , where I work on machine learning / natural language understanding.
Prior to Google, I did my PhD in the theory group at the Computer Lab in Cambridge, supervised by Prof. Anuj Dawar , working in the areas of algorithm design, (parameterized) complexity theory, graph theory and (finite) model theory. My PhD dissertation explores the idea of using distances that measure how far a graph is from belonging to a class of sparse graphs as a parameter for graph problems, also showing that many popular parameters can be understood as distances in that sense.
Before Cambridge, I completed a BSc in Mathematics and Computer Science at Imperial College London and an MSc in Mathematics and Foundations of Computer Science at the University of Oxford .