Reachability Is in DynFO.
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity.
The Cost of Unknown Diameter in Dynamic Networks.
On Algebraic Branching Programs of Small Width.
The Parameterized Complexity of the
General Belief Revision.
Subcubic Equivalences Between Path, Matrix, and Triangle Problems.
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms.