Graduated from the Saint Petersburg Academic University in 2011.
PhD obtained from University of London. Subject area: computational complexity, proof complexity, bounded arithmetic. Thesis title: "Complexity of Propositional Proofs with Counting: Resolution over Linear Equations and Semi-Algebraic Proofs".
Fedor's research interests include computational complexity, mathematical logic, representation theory and quantum groups.
Apart from JetBrains works at the Institute of Mathematics of Czech Academy of Sciences in Prague.