Reachability and the Power of Local Ordering. - Kousha Etessami; Neil Immerman (Theor. Comput. Sci., 1995)

An Until Hierarchy for Temporal Logic. - Kousha Etessami; Thomas Wilke (LICS, 1996)

Counting Quantifiers, Successor Relations, and Logarithmic Space. - Kousha Etessami (J. Comput. Syst. Sci., 1997)

Dynamic Tree Isomorphism via First-Order Updates. - Kousha Etessami (PODS, 1998)

Stutter-Invariant Languages, omega-Automata, and Temporal Logic. - Kousha Etessami (CAV, 1999)

Optimizing Büchi Automata. - Kousha Etessami; Gerard J. Holzmann (CONCUR, 2000)

From Rule-based to Automata-based Testing. - Kousha Etessami; Mihalis Yannakakis (FORTE, 2000)

Tree Canonization and Transitive Closure. - Kousha Etessami; Neil Immerman (Inf. Comput., 2000)

An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. - Kousha Etessami; Thomas Wilke (Inf. Comput., 2000)

A note on a question of Peled and Wilke regarding stutter-invariant LTL. - Kousha Etessami (Inf. Process. Lett., 2000)

Analysis of Recursive State Machines. - Rajeev Alur; Kousha Etessami; Mihalis Yannakakis (CAV, 2001)

Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. - Kousha Etessami; Thomas Wilke; Rebecca A. Schuller (ICALP, 2001)

Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs. - Margaret H. Smith; Gerard J. Holzmann; Kousha Etessami (RE, 2001)

Parametric temporal logic for "model measuring". - Rajeev Alur; Kousha Etessami; Salvatore La Torre; Doron A. Peled (ACM Trans. Comput. Log., 2001)

A Hierarchy of Polynomial-Time Computable Simulations for Automata. - Kousha Etessami (CONCUR, 2002)

First-Order Logic with Two Variables and Unary Temporal Logic. - Kousha Etessami; Moshe Y. Vardi; Thomas Wilke (Inf. Comput., 2002)

Compression of Partially Ordered Strings. - Rajeev Alur; Swarat Chaudhuri; Kousha Etessami; Sudipto Guha; Mihalis Yannakakis (CONCUR, 2003)

Inference of Message Sequence Charts. - Rajeev Alur; Kousha Etessami; Mihalis Yannakakis (IEEE Trans. Software Eng., 2003)

Verifying Probabilistic Procedural Programs. - Javier Esparza; Kousha Etessami (FSTTCS, 2004)

A Temporal Logic of Nested Calls and Returns. - Rajeev Alur; Kousha Etessami; P. Madhusudan (TACAS, 2004)

Analysis of Recursive Game Graphs Using Data Flow Equations. - Kousha Etessami (VMCAI, 2004)

Probability and Recursion. - Kousha Etessami; Mihalis Yannakakis (ISAAC, 2005)

Checking LTL Properties of Recursive Markov Chains. - Mihalis Yannakakis; Kousha Etessami (QEST, 2005)

On-the-Fly Reachability and Cycle Detection for Recursive State Machines. - Rajeev Alur; Swarat Chaudhuri; Kousha Etessami; P. Madhusudan (TACAS, 2005)

Algorithmic Verification of Recursive Probabilistic State Machines. - Kousha Etessami; Mihalis Yannakakis (TACAS, 2005)

Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata. - Kousha Etessami; Thomas Wilke; Rebecca A. Schuller (SIAM J. Comput., 2005)

Realizability and verification of MSC graphs. - Rajeev Alur; Kousha Etessami; Mihalis Yannakakis (Theor. Comput. Sci., 2005)

Analysis of recursive state machines. - Rajeev Alur; Michael Benedikt; Kousha Etessami; Patrice Godefroid; Thomas W. Reps; Mihalis Yannakakis (ACM Trans. Program. Lang. Syst., 2005)

Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. - Kousha Etessami; Mihalis Yannakakis (STACS, 2006)

On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). - Kousha Etessami; Mihalis Yannakakis (FOCS, 2007)

PReMo : An Analyzer for P robabilistic Re cursive Mo dels. - Dominik Wojtczak; Kousha Etessami (TACAS, 2007)

The computational complexity of evolutionarily stable strategies. - Kousha Etessami; Andreas Lochbihler (Int. J. Game Theory, 2008)

First-Order and Temporal Logics for Nested Words. - Rajeev Alur; Marcelo Arenas; Pablo Barceló; Kousha Etessami; Neil Immerman; Leonid Libkin (Log. Methods Comput. Sci., 2008)

Multi-Objective Model Checking of Markov Decision Processes. - Kousha Etessami; Marta Z. Kwiatkowska; Moshe Y. Vardi; Mihalis Yannakakis (Log. Methods Comput. Sci., 2008)

Recursive Concurrent Stochastic Games. - Kousha Etessami; Mihalis Yannakakis (Log. Methods Comput. Sci., 2008)

Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. - Kousha Etessami; Mihalis Yannakakis (J. ACM, 2009)

One-Counter Stochastic Games. - Tomás Brázdil; Václav Brozek; Kousha Etessami (FSTTCS, 2010)

One-Counter Markov Decision Processes. - Tomás Brázdil; Václav Brozek; Kousha Etessami; Antonín Kucera 001; Dominik Wojtczak (SODA, 2010)

Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. - Kousha Etessami; Dominik Wojtczak; Mihalis Yannakakis (Perform. Evaluation, 2010)

On the Complexity of Nash Equilibria and Other Fixed Points. - Kousha Etessami; Mihalis Yannakakis (SIAM J. Comput., 2010)

An abort-aware model of transactional programming. - Kousha Etessami; Patrice Godefroid (Int. J. Softw. Tools Technol. Transf., 2011)

Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (STOC, 2012)

Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (CoRR, 2012)

Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011). - Kousha Etessami; Dieter van Melkebeek; Seth Pettie; John Watrous; Salil P. Vadhan (SIAM J. Comput., 2012)

Model Checking of Recursive Probabilistic Systems. - Kousha Etessami; Mihalis Yannakakis (ACM Trans. Comput. Log., 2012)

Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (ICALP (2), 2013)

Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems. - Kousha Etessami (LATA, 2013)

The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk). - Kousha Etessami (STACS, 2013)

A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (Electron. Colloquium Comput. Complex., 2013)

Approximating the termination value of one-counter MDPs and stochastic games. - Tomás Brázdil; Václav Brozek; Kousha Etessami; Antonín Kucera 001 (Inf. Comput., 2013)

The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. - Kousha Etessami; Kristoffer Arnsfelt Hansen; Peter Bro Miltersen; Troels Bjerre Sørensen (SAGT, 2014)

The complexity of computing a (perfect) equilibrium for an n-player extensive form game of perfect recall. - Kousha Etessami (CoRR, 2014)

Recursive Markov Decision Processes and Recursive Stochastic Games. - Kousha Etessami; Mihalis Yannakakis (J. ACM, 2015)

Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata. - Alistair Stewart; Kousha Etessami; Mihalis Yannakakis (J. ACM, 2015)

Algorithms for some infinite-state MDPs and stochastic games. - Kousha Etessami (LICS, 2017)

A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (SIAM J. Comput., 2017)

Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (Inf. Comput., 2018)

Reachability for Branching Concurrent Stochastic Games. - Kousha Etessami; Emanuel Martinov; Alistair Stewart; Mihalis Yannakakis (ICALP, 2019)

Recursive stochastic games with positive rewards. - Kousha Etessami; Dominik Wojtczak; Mihalis Yannakakis (Theor. Comput. Sci., 2019)

Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. - Kousha Etessami; Christos H. Papadimitriou; Aviad Rubinstein; Mihalis Yannakakis (ITCS, 2020)

Qualitative Multi-objective Reachability for Ordered Branching MDPs. - Kousha Etessami; Emanuel Martinov (RP, 2020)

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. - Kousha Etessami; Alistair Stewart; Mihalis Yannakakis (Math. Oper. Res., 2020)

Analysis of probabilistic processes and automata theory. - Kousha Etessami (Handbook of Automata Theory (II.), 2021)

The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game. - Kousha Etessami (Games Econ. Behav., 2021)

Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051). - Albert Atserias; Christoph Berkholz; Kousha Etessami; Joanna Ochremiak (Dagstuhl Reports, 2022)