Abstract
In this talk I will quickly explain my provenance and research
interests, and then give an overview of my latest 2-3 recent work (depending on
time): 1. A hardness result about computing the probability of a matching in
unbounded-treewidth graph families; 2. A result about enumerating the words of
a given regular language with small edit distance between consecutive words,
and 3. Work on explaining database answers based on the framework of Shapley
values.