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 invited talks/tutorial slides
Postdoctoral research associate:
Václav Broek (Newton Fellow, now at Google-Munich)
Dominik Wojtczak (completed Ph.D. in 2009, now Lecturer at U. of Liverpool)
I'm looking for Ph.D. students with a strong
mathematics/theoretical computer science background (and good programming
skills are also a plus).
If you are interested in applying for Ph.D. study with me, please do so via the School of Informatics' postgraduate application web page.
(You may also consider applying for a Ph.D. studentship within the doctoral training programme in pervasive parallelism with which I have an affiliation.)
PReMo: an analyzer for probabilistic recursive models (developed by D. Wojtczak).
Conferences and program committees:
ITCS 2014 (5th Innovations in Theoretical Computer Science conference)
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