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 and descriptive complexity.

Ph.D., Computer Science, University of Massachusetts-Amherst, 1995.
MSc., Computer Science, Univ. of Massachusetts-Amherst, 1994.
BSc., Computer Science, State U. of New York at Albany, 1990.

Kousha Etessami is a Reader in the School of Informatics, University of Edinburgh, which he joined in 2002. From 1997 to 2002 he was a member of the research staff at Bell Laboratories in Murray Hill, NJ. He received a Ph.D. in computer science at the University of Massachusetts-Amherst in 1995, and he held postdoctoral fellowships at DIMACS (1995-1996) and BRICS (1996-7). Etessami’s research has spanned several areas of theoretical computer science: algorithms and logic, computational complexity, automated verification and model checking, automata theory, and more recently algorithmic game theory and equilibrium computation, and algorithmic analysis of infinite-state stochastic models and stochastic
games.