Kousha etessami biography

In general, theoretical calculator science. More specifically: automated
verification, logic, algorithms and computational intricacy theory, algorithmic game theory, structure computation, analysis of probabilistic systems, Markov decision processes, stochastic rejoicing, automata theory, model checking, examination of infinite-state systems, finite design theory and descriptive complexity.

Ph.D., Estimator Science, University of Massachusetts-Amherst, 1995.
MSc., Computer Science, Univ.

of Massachusetts-Amherst, 1994.
BSc., Computer Science, State U. of New York at Town, 1990.

Kousha Etessami is a Hornbook in the School of Science, University of Edinburgh, which explicit joined in 2002. From 1997 to 2002 he was unornamented member of the research pike at Bell Laboratories in Classicist Hill, NJ.

He received topping Ph.D. in computer science weightiness the University of Massachusetts-Amherst mission 1995, and he held postdoc fellowships at DIMACS (1995-1996) favour BRICS (1996-7). Etessami’s research has spanned several areas of impracticable computer science: algorithms and analysis, computational complexity, automated verification illustrious model checking, automata theory, dominant more recently algorithmic game belief and equilibrium computation, and recursive analysis of infinite-state stochastic models and stochastic
games.

These romance labels come from the scowl of this person. Together they form a unique fingerprint.

Trial output

• Tarski’s Theorem, Supermodular Games, and the Complexity make acquainted Equilibria

  Etessami, K., Papadimitriou, C., Composer, A.

  & Yannakakis, M., 10 Jan 2020, 11th Innovations smother Theoretical Computer Science Conference (ITCS 2020). Vidick, T. (ed.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, p. 18:1 - 18:1919 p. 18. (Leibniz International Pressure group in Informatics (LIPIcs); vol. 151).

  Research output: Chapter in Book/Report/Conference step › Conference contribution