PhD advisor: Anil N. Hirani
I graduated in May 2021. My research interests lie in graph theory, logic, algorithms and computational topology. My doctoral thesis: Graphical structure of unsatisfiable boolean formulae combines the tools of graph theory and topology to analyze boolean satisfiability – a classic problem in logic and computer science.
I currently hold an industry position and am also working on extending my doctoral work towards the upcoming and adjacent field of computer-assisted formalized mathematics and interactive theorem proving (in particular, with the Lean theorem prover).