Kousha Etessami
Research interests: In general, theoretical computer science. More
specifically:
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.
Publications: publications available online.
Teaching:
Algorithmic game theory course (Spring '03-'09).
Compiling techniques course (Spring '03-'05)
(Stochastic) Modelling and Simulation course (Fall '05-'07).
Some lecture/tutorial slides:
"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).
"Analysis of Recursive Markov Chains, Recursive Markov Decision Processes,
and Recursive Stochastic Games",
from talks given at Dagstuhl and at
Newton Institute workshops,2005-06.
Lecture notes
on "Automata-theoretic Model Checking",
SFM'02:MC School on Model
Checking, 2002.
Postdoctoral research associate:
Václav Brožek (Newton Fellow)
Ph.D. students:
Dominik Wojtczak
(completed Ph.D. in 2009; now a postdoc at CWI)
(If you are interested in applying for Ph.D. study with me, please see the School of Informatics' postgraduate application web page.)
Tools:
PReMo:
an analyzer for probabilistic recursive models (developed by D. Wojtczak).
Conferences and program committees:
QEST'10
ICALP'09
FOSSACS'09
Logic and Algorithms'08
(co-organizer with
Anuj Dawar and
Moshe Vardi)
SPIN'08
QEST'07
CONCUR'06
LICS'06
CAV'05
(co-chair with Sriram Rajamani)
CAV'04
CSL'04
Some old software for LTL to Büchi translation