My research is currently supported in part by the National Science Foundation (link).
My interests have evolved over the years. I initially started research in nature-inspired computation, with a focus on the theory of evolutionary algorithms. Due to the inherent difficulty in deriving formal guarantees (such as convergence, approximation ratio, etc.) for evolutionary heuristics, I eventually transitioned away from that domain. During my Ph.D., I predominantly focused on algorithms and data structures. My dissertation addressed problems in comparison complexity models and routing models for graphs. During my postdoctoral research, I explored a variety of topics, including the well-quasi ordering of bigenic induced subgraphs, graph labeling, and several variants of the min-uncut problem. I also ventured into online algorithms, particularly the \(k\)-server problems. In the past two years, my focus has pivoted to the theory of quantum computing. Like many in this field, I'm keen on identifying "natural" problems where there's a definitive quantum advantage. Specifically, my current research centers on exploring quantum walks and their generalizations, as well as quantum property testing.
~A Gruk about Gruks~
If you wish to write a Grook
that's witty and smart,
then don't go on reading a crook
like this for a start.