A taxonomy of fixed point computation problems for algebraically-defined functions, and their computational complexity.
Invited talk at the Simons Institute Workshop on "Solving Polynomial Equations", October 2014.

The computational complexity of analyzing infinite-state structured Markov Chains and structured MDPs.
Invited talk at 9th Int. Conference on Matrix-Analytic Methods in Stochastic Models (MAM-9), June 2016.

Algorithms for Branching MDPs and Branching Stochastic Games. Invited talk at CASSTING'16, April 2016.

Algorithms for Branching Markov Decision Processes. Invited talk at RP2014, September 2014.

Tutorial: Complexity of Equilibria and Fixed points: FIXP, FIXP_a, and linear-FIXP (= PPAD). Tutorial at Dagstuhl workshop on Equilibrium Computation, August 2014.

The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games. Invited talk at STACS'2013.
(Similar keynote talk given at China Theory Week 2013, and similar invited talk given at LATA'13.)

Algorithms and complexity of analyzing unrestricted stochastic context-free grammars. Invited tutorial at 11th Int. Conf. on Finite State Methods and Natural Language Processing (FSMNLP'2013).

"The Complexity of Nash Equilibria and Fixed Points of Algebraic Functions" . Tutorial at GAMES'08.
(Earlier talk on same subject at Dagstuhl Seminar on Equilibrium Computation, 2007).

"Adding Recursion to Markov Chains, Markov Decision Processes, and Stochastic Games: Algorithms and Complexity", Tutorial at QEST'11.

Lecture notes on "Automata-theoretic Model Checking", SFM'02:MC School on Model Checking, 2002.