Publications: publications available online.
Research interests: In general, theoretical computer science. More
automated verification, logic,
algorithms and computational complexity theory,
algorithmic game theory, equilibrium computation,
analysis of probabilistic systems, Markov decision processes, stochastic games,
automata theory, model checking,
analysis of infinite-state systems,
finite model theory and descriptive complexity.
Algorithmic game theory course.
Discrete Mathematics course .
(Stochastic) Modelling and Simulation course (Fall '05-'10).
Compiling techniques course (Spring '03-'05).
Some talk/tutorial slides:
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games. Invited talk at STACS'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.
Postdoctoral research associate:
Václav Broek (Newton Fellow)
Dominik Wojtczak (completed Ph.D. in 2009)
(If you are interested in applying for Ph.D. study with me, please see the School of Informatics' postgraduate application web page.)
PReMo: an analyzer for probabilistic recursive models (developed by D. Wojtczak).
Conferences and program committees:
Horizons in Theoretical Computer Science: A Celebration of Mihalis Yannakakis's 60th Birthday, CCI/Princeton, August, 2013.
SAGT'2010: 3rd. Int. Symp. on Algorithmic Game Theory
Logic and Algorithms'08 (co-organizer with Anuj Dawar and Moshe Vardi)
CAV'05 (co-chair with Sriram Rajamani)
Some old software for LTL to Büchi translation